Combinatorial Mathematics
The course covers basic combinatorial theory including permutations and combinations, the inclusion-exclusion principle and other general counting techniques, partitions, generating functions, recurrence relations, Burnside's Theorem, the cycle index, and Polya's formula.
Prerequisites: MATH 313 or COMP 163.
Outcomes: Students will learn mathematical techniques in discrete mathematics and applied combinatorics.
Prerequisites: MATH 313 or COMP 163.
Outcomes: Students will learn mathematical techniques in discrete mathematics and applied combinatorics.