| 1 | Introduction and proofs | |
| 2 | Induction | Problem set 1 due |
| 3 | Strong induction | |
| 4 | Number theory I | Problem set 2 due |
| 5 | Number theory II | |
| 6 | Graph theory and coloring | Problem set 3 due |
| 7 | Matching problems | |
| 8 | Graph theory II: minimum spanning trees | Problem set 4 due |
| 9 | Communication networks | |
| 10 | Graph theory III | Problem set 5 due |
| 11 | Relations, partial orders, and scheduling | |
| 12 | Sums | Problem set 6 due |
| 13 | Sums and asymptotics | |
| 14 | Divide and conquer recurrences | Problem set 7 due |
| | Midterm | |
| 15 | Linear recurrences | |
| 16 | Counting rules I | Problem set 8 due |
| 17 | Counting rules II | |
| 18 | Probability introduction | Problem set 9 due |
| 19 | Conditional probability | Problem set 10 due |
| 20 | Independence | |
| 21 | Random variables | Problem set 11 due |
| 22 | Expectation I | |
| 23 | Expectation II | Problem set 12 due |
| 24 | Large deviations | |
| 25 | Random walks | |
