Advanced topics in discrete mathematics and combinatorics including setting up and solving recurrence relations, finite calculus, manipulation and evaluation of sums, Möbius inversion, binomial coefficients, Fibonacci numbers, Stirling numbers, and generating functions.
Prerequisites: Bachelor's degree in mathematics, mathematics education, statistics or related field. Note: Graduate admission status required. Students whose prerequisites are not identified by the system should contact the Math and Statistics Department for an override at MATH@metrostate.edu.18 Credit Credentialing Pathways
3 Graduate credits
Effective August 19, 2018 to present
- Use recurrence relations to formulate and solve combinatorial problems.
- Manipulate and evaluate complicated sums.
- Prove and use identities involving binomial coefficients.
- Prove and use identities involving special numbers such as Fibonacci numbers and Stirling numbers.
- Find and use generating functions to solve combinatorial problems.