Site menu:

Lecture notes

Some slides are based on the slides in MIT 6.042 (Spring 2007).

Lecture 19: matching [slides].
  • Read Chapter 5.1 and 6.2 of the notes.
Lecture 18: graphs [slides].
  • Read Chapter 11.1-11.2 of the textbook.
Lecture 17: recursion [slides] (updated: Nov 13).
  • Read Chapter 8.1-8.3 of the textbook.
Lecture 16: more counting [slides].
  • Read Chapter 6.4-6.5 of the textbook, and Chapter 10.1, 10.5, 11.3 of the notes.
Lecture 15: functions [slides].
  • Read Chapter 7 of the textbook.
Lecture 14: inclusion-exclusion principle [slides].
  • Read Chapter 6.3 of the textbook.
Lecture 13: basic counting [slides].
  • Read Chapter 6.2-6.4 and 6.6-6.7 of the textbook.
Lecture 12: set theory [slides].
  • Read Chapter 5 of the textbook.
Lecture 11: cryptography [slides] (updated Oct 19).
  • Read Chapter 10.4 of the textbook and Chapter 8.6-8.10 of notes.
Lecture 10: Chinese remainder theorem [slides].
  • Read Chapter 10.4 of the textbook.
Lecture 9: modular arithmetic [slides].
  • Read Chapter 10.4 of the textbook.
Lecture 8: greatest common divisor [slides] (updated: Oct 5).
  • Read Chapter 10.4 of the textbook.
Lecture 7: number sequences [slides] (updated: Sep 30).
  • Read Chapter 4.1 of the textbook and Chapter 9 of notes.
Lecture 6: invariant method [slides].
  • Read Chapter 4.7 of notes.
Lecture 5: induction [slides].
  • Read Chapter 4.2-4.4 of the textbook and Chapter 3.3-3.6 of notes.
Lecture 4: methods of proof [slides].
  • Read Chapter 3 of the textbook.
Lecture 3: first order logic [slides].
  • Read Chapter 2 of the textbook.
Lecture 2: propositional logic [slides].
  • Read Chapter 1.2 and 1.3 of the textbook.
Lecture 1: introduction to discrete mathematics [slides] (updated: Sep 9).
  • Read Chapter 1.1 of the textbook.