Units: 1.5, Hours: 3-0
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.
Prerequisites: 212 or 233C; 222; and at least 1.5 units of MATH courses numbered 300 or higher; or permission of the department.
Undergraduate course in Mathematics offered by the Department of Mathematics and Statistics in the Faculty of Science.