MATH 142 - Introduction to Combinatorics

3 unit(s)
Sets, permutations, combinations, probability, mathematical induction, counting techniques, generating functions, partitions, recurrence relations, inclusion-exclusion. Polya’s theorem and applications to computer science, mathematics, engineering and physical sciences.

Prerequisite(s): MATH 31 or MATH 31X, and MATH 42 or MATH 42X (each with a grade of “C-” or better). Or instructor consent. Allowed Declared Major: Mathematics major/minor, Computer Science, BS Data Science, or Software Engineering.
Grading: Letter Graded

Class Schedule | Syllabus Information | University Bookstore