Permutations and combinations, generating functions, recurrence relations, inclusion-exclusion principle. Mobius inversion, Polya's enumeration theorem. Ramsey's theorem, systems of distinctive representatives, combinatorial designs, algorithmic aspects of combinatorics.
- MATH 212 and MATH 222; and
- 1.5 units of 300- or 400-level MATH course; or
- permission of the department.