January 17: Chapter 1: Brute-force verification versus proof.

January 19: Chapter 1: Proof by contradiction. Coloring and counting arguments.

January 24: Chapter 2: The pigeonhole principle.

January 26: Chapter 2: The pigeonhole principle (concluded). Chapter 3: Addition and subtraction rules.

January 31: Chapter 3: Multiplication and division rules. Permutations of sets.

February 2: Chapter 3. Combinations of sets.

February 7: Chapter 3. Permutations of multisets.

February 9: Chapter 3. Combinations of multisets.

February 14: Chapter 3. Combinations of multisets (concluded). Chapter 5. Lattice paths.

February 16: Chapter 5. Lattice paths and combinations. Proof by mathematical induction.

February 21: Chapter 5. Binomial coefficient identities.

February 23: Chapter 5. Multinomial theorem.

February 28: Chapter 5. Newton's binomial theorem.

March 2: Review.

March 7: Midterm exam.

March 9: Principle of inclusion-exclusion.

March 21: Derangements. The space of solutions to the Fibonacci recurrence.

March 23: Homogeneous linear recurrence relations.

March 28: Non-homogeneous linear recurrence relations.

March 30: Generating functions.

April 4: Formal power series.

April 6: Formal power series (continued).

April 11: Formal power series (concluded). Catalan numbers.

April 13: Difference tables.

April 18: Stirling numbers.

April 20: Stirling numbers (concluded). Partitions of numbers.

April 25: Partitions of numbers (concluded). Polya theory.

April 27: Polya theory (continued).

May 2: Polya theory (continued).

May 4: Polya theory (concluded).