MATH290
Download as PDF
TOPICS:
Course Description
The descriptions and topics of this course change from semester-to-semester, as well as from instructor-to-instructor. Prerequisite: varies with the topic offered.
MATH 290 COMBINATORICS. This course is an introduction to the mathematics of examining discrete objects by counting them, constructing them, and finding algorithms to analyze them. Topics include enumeration techniques, permutations, combinations, pigeonhole principle, principle of inclusion-exclusion, generating functions, and recurrence relations as they naturally arise in graph theory, partition theory, group theory, probability, and games.
MATH 290 COMBINATORICS. This course is an introduction to the mathematics of examining discrete objects by counting them, constructing them, and finding algorithms to analyze them. Topics include enumeration techniques, permutations, combinations, pigeonhole principle, principle of inclusion-exclusion, generating functions, and recurrence relations as they naturally arise in graph theory, partition theory, group theory, probability, and games.