MATH 28130
Honors Discrete Mathematics
We emphasize mathematical discovery and rigorous proof, which are illustrated on a refreshing variety of accessible and useful topics. Basic counting is a recurring theme. Further topics include proof by induction; number theory, congruences, and Fermat's little theorem; relations; factorials, binomial coefficients and advanced counting; combinatorial probability; random variables, expected value, and variance; graph theory and trees. Time permitting, material on recurrences, asymptotic equality, rates of growth and Markov chains may be included as well. The honors version of Discrete Mathematics covers topics at a deeper level.
Topics
- proof by induction
- number theory
- congruences
- and Fermat's little theorem
- relations
- factorials
- binomial coefficients and advanced counting
- combinatorial probability
- random variables
- expected value
- and variance
- graph theory and trees
Topics explicitly listed in official catalogue description
Sources
- Course catalogue ↗2026-2027