MATH 3200 Combinatorics

MATH 3200 Combinatorics
Combinatorics
Basics of combinatorics with emphasis on problem solving. Provability, pigeonhole principle, mathematical induction. Counting techniques, generating functions, recurrence relations, Polya's counting formula, a theorem of Ramsey.
Pre-requistites: MATH 1210, 1220, and either 2210 or 3090 or approval of instructor.
credit hours: 3