Combinatorics

Undergraduate

This course will cover finite combinatorics, in particular, the pigeonhole principle, permutations and combinations, binomial coefficients, the inclusion-exclusion principle, recurrence relations and generating functions, special counting sequences, Polya counting. (Prerequisites: MATH-1730 and MATH-1020.) (3 lecture hours per week.)