This section contains slides, in-class problems, and solutions. Students work in groups to solve the in-class problems; see the Syllabus for more information.
Powerpoint and LaTeX source files and LaTeX macros are available to instructors by request: email Prof. Albert Meyer at meyer at csail dot mit dot edu.
| LEC # | TOPICS | SLIDES | PROBLEMS | SOLUTIONS |
|---|---|---|---|---|
| Week 1 | ||||
| 1 | Good and bad proofs | ( PDF) | (PDF) | (PDF) |
| 2 | Proof by contradiction | ( PDF) | (PDF) | (PDF) |
| Week 2 | ||||
| 3 | Well ordering principle | ( PDF) | (PDF) | (PDF) |
| 4 | Propositional logic | ( PDF) | (PDF) | (PDF) |
| 5 | Sets and relations | ( PDF - 2.0MB) | (PDF) | (PDF) |
| Week 3 | ||||
| 6 | Size of sets, mapping lemma | ( PDF) | (PDF) | (PDF) |
| 7 | Predicates and quantifiers | ( PDF) | (PDF) | (PDF) |
| 8 | Set theory, Russell paradox | ( PDF) | (PDF) | (PDF) |
| Week 4 | ||||
| 9 | Induction and strong induction | ( PDF) | (PDF) | (PDF) |
| 10 | Partial orders | ( PDF) | (PDF) | (PDF) |
| 11 | Partial orders and scheduling | ( PDF) | (PDF) | (PDF) |
| Week 5 | ||||
| 12 | Digraphs | ( PDF) | (PDF) | (PDF) |
| 13 | State machines, preserved invariants | ( PDF) | (PDF) | (PDF) |
| 14 | Derived variables, termination | ( PDF) | (PDF) | (PDF) |
| Week 6 | ||||
| 15 | Stable matching | ( PDF - 2.5MB) | (PDF) | (PDF) |
| 16 | Simple graphs, degrees, isomorphism | ( PDF) | (PDF) | (PDF) |
| 17 | Graph connectedness, trees | ( PDF) | (PDF) | (PDF) |
| Week 7 | ||||
| 18 | Graph coloring, bipartite matching | ( PDF) | (PDF) | (PDF) |
| 19 | Recursive data | ( PDF) | (PDF) | (PDF) |
| 20 | Planar graphs | ( PDF) | (PDF) | (PDF) |
| Week 8 | ||||
| 21 | GCD and integer linear combinations | ( PDF) | (PDF) | (PDF) |
| 22 | Modular arithmetic | ( PDF) | (PDF) | (PDF) |
| 23 | Inverses (mod n), RSA encryption | ( PDF) | (PDF) | (PDF) |
| Week 9 | ||||
| 24 | Harmonic sums, Stirling's approximation | ( PDF) | (PDF) | (PDF) |
| 25 | Asymptotics | ( PDF) | (PDF) | (PDF) |
| 26 | Counting with bijections | ( PDF) | (PDF) | (PDF) |
| Week 10 | ||||
| 27 | Pigeonhole and division rules | ( PDF) | (PDF) | (PDF) |
| 28 | Counting repetitions, card magic | ( PDF) | (PDF) | (PDF) |
| 29 | Inclusion-exclusion, counting practice | ( PDF) | (PDF) | (PDF) |
| Week 11 | ||||
| 30 | Binomial theorem, combinatorial identities | ( PDF) | (PDF) | (PDF) |
| 31 | Generating functions: for counting | ( PDF) | (PDF) | (PDF) |
| Week 12 | ||||
| 32 | Generating functions: for recurrences | ( PDF) | (PDF) | (PDF) |
| 33 | Introduction to probability | ( PDF) | (PDF) | (PDF) |
| 34 | Conditional probability, independence | ( PDF) | (PDF) | (PDF) |
| Week 13 | ||||
| 35 | Random variables | ( PDF) | (PDF) | (PDF) |
| 36 | Expectation | ( PDF) | (PDF) | (PDF) |
| 37 | Variance | ( PDF) | (PDF) | (PDF) |
| Week 14 | ||||
| 38 | Sampling and confidence | ( PDF) | (PDF) | (PDF) |
| 39 | Random processes | ( PDF) | (PDF) | (PDF) |

