This course involves the study of finite mathematical objects, including their enumeration, structural properties, and applications to areas such as probability, statistics, and computer science. Topics include fundamental counting problems and combinatorial functions such as factorials, binomial coefficients, and Catalan numbers, enumeration methods such as inclusion/exclusion and generating functions, structure theory of important combinatorial objects such as partitions and permutations, and classical combinatorial theorems such as the pigeonhole principle and the Polya enumeration theorem.

Offered: Fall Term of even-numbered years