October Lectures

Week of October 6-10

Oct 7: Euler-Maclaurin formula; properties of Bernoulli numbers. Examples.
Oct 9: Examples of the use of the Euler-Maclaurin formula: Harmonic numbers and Stirling's approximation. [A1 in; A2 out]

Week of October 13-17

Oct 14: Examples of the use of the Euler-Maclaurin formula: Catalan numbers. The Symbolic Method: basic definitions and constructions.
Oct 16: Comments about final project and assignment 2.

Week of October 20-24

Oct 21: The admissibility theorem for unlabelled constructions and ordinary generating functions. Examples of the use of the symbolic method: patterns.
Oct 23: Examples of the use of the symbolic method: patterns (cont); internal number of nodes in a binary tree.

Week of October 27-31

Oct 28: Binary trees: external, and total number of nodes; general trees and forests.
Oct 30: Polynomials over finite fields.

To September lectures.
To November lectures.