MATH 450 - Combinatorics

Units: 3
Counting techniques, Fibonacci numbers, partitions of integers, generating functions, multinomial coefficients, Stirling numbers, Catalan numbers, Pigeon Hole Principle, Ramseys Theorem, inclusion/exclusion, and a variety of other topics.

Prerequisites: MATH 300 with grade C- or better.
Equivalent Quarter Course: MATH 3151.
Possible Instructional Methods: Entirely On-ground.
Grading: A-F or CR/NC (student choice).
Student Learning Outcomes - Upon successful completion of this course students will be able to:

Apply the definitions, techniques and theorems of combinatorics.
Creatively conjecture and rigorously write, analyze and critique proofs in combinatorics.
Communicate solutions to problems in combinatorics effectively.