MATH 650 - Combinatorics

Units: 4
Counting techniques, Fibonnacci numbers, partitions of integers, generating functions, multinomial coefficients, Stirling numbers, Catalan numbers, Pigeon Hole Principle, Ramsey’s Theorem, inclusion/exclusion, Polya’s Theorem, other topics such as graph theory.

Prerequisites: MATH 300 or MATH 320.
Possible Instructional Methods: Entirely On-ground.
Grading: A-F grading only.
Student Learning Outcomes - Upon successful completion of this course students will be able to:

Apply the fundamental definitions and theorems of combinatorics.
Apply the techniques of combinatorics to solve problems.

Print this Page