Back to my homepage
### Topics to be covered (Approx):

Basic counting, binomial and multinomial coefficients, bijections, inclusion-exclusion, pigeon-hole principle, recursion and generating functions, asymptotic notation.

2. Any book on discrete mathematics; for example the one by Norman L. Briggs or the one by Kenneth Rosen or the one by Lovasz.

3. Any book on combinatorics; eg: Concrete Mathematics by Knuth and Patashnik; the book by van Lint and Wilson; a path to combinatorics for undergraduates.

Click here for a couple of exercises for the first class.

Problem Set 1.

Problem Set 2.