Basics of enumeration (combinations, permutations and enumeration of functions between finite sets), generating functions; the inclusion-exclusion principle, partition
theory and introductory graph theory. As time permits, additional topics may include Ramsey's Theorem, probabilistic methods in combinatorics and algebraic methods in combinatorics. Prerequisites: Math 132, 309 and 310, or permission of the instructor.
Course Attributes: FA NSM; AR NSM; AS NSM; AS AN