1. CS/APMA 202 Spring 2005 Aaron Bloomfield

2. Sequences in Nature 13 8 5 3 2 1

3. Course objectives Logic: Introduce a formal system (propositional and predicate logic) which mathematical reasoning is based on Proofs: Develop an understanding of how to read and construct valid mathematical arguments (proofs) and understand mathematical statements (theorems), including inductive proofs. Also, introduce and work with various problem solving strategies and techniques Counting: Introduce the basics of integer theory, combinatorics, and counting principles, including a brief introduction to discrete probability Structures: Introduce and work with important discrete data structures such as sets, relations, sequences, and discrete functions Applications: Gain an understanding of some application areas of the material covered in the course

4. Textbook (Required) Kenneth Rosen, Discrete Math and Its Applications, 5th edition. McGraw Hill, 2003

5. Student Solution Guide (Optional) Kenneth Rosen, Student's Solutions Guide for use with Discrete Mathematics and Its Applications, 5th edition. McGraw Hill, 2002

6. Don’t get the wrong textbooks! 4 th edition books:

7. Grades

8. Grade Distribution B- F D C B A

9. Motivational posters…

10. Quick survey … a) Too slow b) A little slow c) About right d) Fast