Mathematics 281 - Combinatorics

This course emphasizes enumerative combinatorics, a classical subject in mathematics related to the theory of counting. Problems in this area often pertain to finding the number of possible arrangements of a set of objects under some particular constraints. This course incorporates a wide set of problems involving enumerative combinatorics, as well as theory and applications. Topics include the sum and product rules; combinations and permutations; binomial and multinomial coefficients; the principle of inclusion and exclusion; generating functions; recurrence relations; Catalan, Stirling, Bell and Eulerian numbers; partitions. Additional topics may vary.

MATH 121, and one of MATH 220, 271, or 272, or other experience with mathematical proofs by consent of the instructor is required. Limited to 25 students.

How to handle overenrollment: Preference is given to math majors.

Students who enroll in this course will likely encounter and be expected to engage in the following intellectual skills, modes of learning, and assessment: Problem sets, In-class quizzes or exams, Take-home exams.