Combinatorics

Combinatorics
Permutations, combinations, recurrence relations, applications.
MATH
450
 Hours3.0 Credit, 3.0 Lecture, 0.0 Lab
 PrerequisitesMATH 371
 TaughtSummer
Course Outcomes

Basics of combinatorics and its relation to other math areas

Permutations and combinations basics, including the Pigeonhole Principle, binomial coefficients and the Binomial Theorem, Stirling's Approximation, Inclusion/exclusion, Generating functions and recurrence relations (rational functions), Groups, permutations and counting problems -- Polya's Theorem. For more detailed information visit the Math 450 Wiki page.