MATH 328
Combinatorics and Enumeration
The theory of combinatorics and enumeration and its contemporary applications, including generating functions and recurrence relations, and the Polya and Ramsey theories. A wide variety of practical applications will be presented.
Prerequisites & course information
Weekly hours: 3 Lecture hours Prerequisite(s): MATH 164.3; and CMPT 260.3, CMPT 263.3, STAT 241.3, or 3 credit units 200- or 300-level MATH.
Sources
- Course catalogue ↗2026-2027