MAT309

MAT

309

Undergraduate

COMBINATORICS

Prerequisite: MAT 162 or MAT 127. Basic counting principles including permutations, combinations, the multiplication and addition rules, and the pigeonhole principle; distribution problems; combinatorial proofs; counting the complement and inclusion-exclusion arguments; breaking counting problems down into smaller subproblems; generating functions; permutation groups and Polya’s enumeration theorem; combinatorial block designs. Offered occasionally.