MATH 4P71 - Combinatorics

Review of basic enumeration including distribution problems, inclusion-exclusion and generating functions. Polya theory. Finite fields. Orthogonal Latin squares, affine and projective planes. Coding theory and cryptography.

Course Format: Lectures, 3 hours per week; tutorial, 1 hour per week.
Prerequisite(s): MATH 2P92 (2P71) or permission of the instructor
Course Notes: This course may be offered in multiple modes of delivery. The method of delivery will be listed on the academic timetable, in the applicable term.