MATH 313 - Combinatorics

An introduction to combinatorics and finite math. This course covers basic counting techniques, including the pigeonhole principle, enumeration of sets, permutations, combinations, partitions and the Binomial Theorem. Combinatorial and algebraic patterns of polynomials are also studied.

Credits: 3

Clock Hours - (Lect-Lab): (3-0)

Prerequisites: MATH 265 (minimum grade of C-)

Notes:
Prerequisites for all math courses must be completed with a grade of C- or better.