Introduction to Discrete Mathematics

The readings below refer to sections in the course's textbook: Essentials of Discrete Mathematics, Second Edition. David J. Hunter. Jones & Bartlett Publishing, 2012.

Date Day Topic Reading
1/6/15 Tu. Number systems, binary addition, and logic circuits *
1/8/15 Th. Logic I 1.1, 1.3
1/13/15 Tu. Logic II 1.1, 1.3
1/15/15 Th. Proofs in propositional logic 1.2
1/20/15 Tu. Proof strategies I 1.5
1/22/15 Th. Functions and sets 2.2, 2.3
1/27/15 Tu. Midterm I
1/29/15 Th. Sequences 3.1, 3.2
2/3/15 Tu. Induction I 3.2
2/5/15 Th. Proof strategies II
2/10/15 Tu. Recursive definitions 3.3, 3.4
2/12/15 Th. Induction II 3.4, 3.5
2/17/15 Tu. Relations and equivalence relations 2.4
2/19/15 Th. Modular arithmetic 2.4.5
2/24/15 Tu. Midterm II
2/26/15 Th. Partial orders and total orders 2.5
3/3/15 Tu. Counting 4.1, 4.2
3/5/15 Th. Counting with functions 4.3
3/10/15 Tu. The uncountable **
3/12/15 Th. Catch-up and review
3/17/15 Tu. Final exam

*Reference material for 1/6/15 can be found in Chapter's 0, 1 and 6.3 of: Ones and Zeros: Understanding Boolean Algebra, Digital Circuits, and the Logic of Sets. J. Gregg. Wiley-IEEE Press, 1996. This can be downloaded from a computer on the UCSD network here.

**Reference material for 3/12/15 can be found in Section 7.5 of: Discrete Mathematics with Applications S. Epp. Thomson Learning, 2004. This book is available on reserve in the library.