Prerequisite: MATH 162 or MATH 162A.
This course offers a rigorous introduction to combinatorics, including topics such as induction, the pigeon-hole principle, permutations, combinations, recurrence relations, generating functions, the inclusion-exclusion principle, and other selected topics.
Outcomes: Students will obtain an understanding of the basic topics in combinatorics that will prepare them for advanced study of related topics in mathematics and computer science.
This course offers a rigorous introduction to combinatorics, including topics such as induction, the pigeon-hole principle, permutations, combinations, recurrence relations, generating functions, the inclusion-exclusion principle, and other selected topics.
Outcomes: Students will obtain an understanding of the basic topics in combinatorics that will prepare them for advanced study of related topics in mathematics and computer science.