| |
Nov 21, 2024
|
|
|
|
|
2013 - 2014 Catalog of Courses [ARCHIVED CATALOG]
|
MATH 313 - Combinatorics
An introduction to combinatorics and finite math. This course will cover basic counting techniques, including the pigeonhole principle, enumeration of sets, permutations, combinations, partitions and the Binomial Theorem. Combinatorial and algebraic patterns of polynomials will be studied.
Credits: 3
Clock Hours - (Lect-Lab): (3-0)
Prerequisites: MATH 221 (minimum grade of C-)
|
|