MATH 3301Combinatorics
Dalton State College · 3 credits

Catalog
Basic counting principles: permutations, combinations, probability, occupancy problems, and binomial coefficients. More sophisticated methods include generating functions, recurrence relations, inclusion/exclusion principles, and the pigeonhole principle. Additional topics include asymptotic enumeration, Polya counting theory, combinatorial designs, coding theory, and combinatorial optimization. (Spring Odd Years) Prerequisite: MATH 2254.
Recent sections
Spring 2027 · 1 section
Jan 11 – May 11
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 01Class #23899 | Mo We · 9:30 – 10:45 AM | Main Campus | Michael J. Joseph |