| Week | Required Readings | Lectures |
|---|---|---|
| 1 |
(9/13) 1.1, 1.3.1-4 (9/15) 1.4.1-10, 1.5 |
(9/13) Propositional Logic (9/15) Predicate Logic |
| 2 |
(9/20) 1.7 (9/22) 1.8.1-7, 1.8.10 |
(9/20) Proof Methods I (9/22) Proof Methods II |
| 3 |
(9/27) 2.1, 2.2.1-3, 2.3.1-3 (9/29) 2.5 |
(9/27) Sets & Functions (9/29) Cardinality of Sets |
| 4 |
(10/4) 4.1, 4.2 (10/6) 4.3 |
(10/4) Introduction to Number Theory (10/6) Primes and GCD |
| 5 |
(10/11) 4.4 (10/13) 4.6 |
(10/11) Solving Congruences (10/13) Cryptography |
| 6 | (10/18) Midterm Review (10/20) Midterm Exam |
|
| 7 |
(10/25) 5.1, 5.2.1-3 (10/27) 5.2.5, 5.3 |
(10/25) Induction (10/27) Well-ordering and Recursive Definitions |
| 8 | (11/3) 9.1. 9.4, 9.5 | (11/1) Enjoy your break! (11/3) Relations |
| 9 |
(11/8) 6.1, 6.2 (11/10) 6.3, 6.4, 6.5 |
(11/8) Counting and the Pigeonhole Principle (11/10) Permutations and Combinations |
| 10 |
(11/15) 7.1 (11/17) 7.2, 7.3 |
(11/15) Introduction to Discrete Probability (11/17) Conditional Probability |
| 11 |
(11/22) 7.4 |
(11/22) Random Variables (11/24) Enjoy your break! |
| 12 |
(11/29) 10.1, 10.2 (12/1) 10.3, 10.4 |
(11/29) Introduction to Graphs (12/1) Representation and Connectivity |
| 13 |
(12/6) 10.5 (12/8) 10.7, 10.8 |
(12/6) Euler and Hamilton Paths (12/8) Planar Graphs and Coloring |
| 14 | (12/13) Final Review | |