MATH 3570 - Combinatorics

An introductory course in combinatorics. Topics include fundamental counting methods, Pigeonhole Principle, binomial coefficients, inclusion-exclusion principle, Twelvefold way, recurrence relations and generating functions. Advanced topics to be selected from Polya theory, combinatorial design, permutation statistics and Ramsey theory. Pre-requisite: MATH 2800 with a grade of C or better

Prerequisite/Corequisite:
MATH 2800 with C or greater

Hours:
3