Combinatorics

Catalog description

This course explores the mathematics of counting and discrete structures. Topics include basic counting principles, permutations, combinations, the Binomial Theorem, and the Inclusion-Exclusion Principle. Intermediate topics include recurrence relations, generating functions, and partitions of integers. The course introduces graph theory and applications, including trees, planar graphs, and graph algorithms. Emphasis is placed on proof techniques such as bijective proofs, double counting, and induction, with connections to computer science and optimization. Prerequisite: CS 115 or CS 120 ; grade of "C" or better in MTH 225 or CS 225 ; grade of "C" or better in MTH 308 . Offered Fall.