MATH 351 - Introduction to Combinatorics

(3)

An introduction to enumerative combinatorics. Topics include permutations, combinations, Stirling numbers, integer partitions, distribution problems, combinatorial proof, recurrence relations, generating functions, Fibonacci numbers, rook theory, and the principle of inclusion-exclusion. Prerequisite(s): MATH 231; MATH 251 or MATH 252;