MATH 172 – Combinatorics
Class times: Tues/Thur 3:30-5:00pm
Instructor: Sylvie Corteel e-mail: lastname
at berkeley dot edu Course homepage:
math.berkeley.edu/~corteel/Math172.html Office hours: TBD, Zoom. Textbook: Introductory
Combinatorics, 5th Ed., Richard A. Brualdi Further reading: How
to Count: An Introduction to Combinatorics, R.B.J.T. Allenby and Alan
Slomson Topics: Selected
topics from Chapters 2-8 and 11-14 of Brualdi Prerequisites:
Math
55 (Discrete Mathematics) Grading: Homework, Quizzes, Midterm, Final, Oral presentation Homework Policies: No
homework will be accepted after class for any reason. You may work
together on homework problems, but your solutions should be written
up independently and reflect your own understanding of the material. Final exam: Special accommodations: In
case of disability, extracurricular activities, or religious
holidays, please follow official university procedure.
Date Topics Reading Homework
The Binomial and Multinomial Coefficients
The Inclusion-Exclusion Principle
The Pigeon-Hole Principle
Recurrence Equations
Generating Functions
Special Counting Sequences: Catalan numbers, Stirling Numbers
Graph theory
Polya counting