Discrete Math·Course
Discrete Mathematics
Discrete mathematics: logic, set theory, combinatorics, graph theory, algorithms, and number theory
Part of the Mathematics track — finish it for a verifiable diploma →
§ 01 — Orientation
New here?
What you'll be able to do, who this is for, how long it takes, and where to begin.
By the end, you will be able to
- 01Reason with logic, sets, and proofs.
- 02Count with combinatorics.
- 03Model problems as graphs.
- 04Use the number theory behind modern crypto.
- 05Think about algorithms rigorously.
Who this is for
How long it takes
- Quick orientationSkim the opening module and the cheatsheet to get the shape of it.~2 h
- Full read-throughRead every article once, in order.~2 h
- Mastery pathRead, take the quizzes, and space out your reviews.~2 weeks
- APA
Stoa. (2026). Discrete Mathematics [Online course]. Stoa. https://stoa.school/course/discrete-math
- MLA
Stoa. “Discrete Mathematics.” Stoa, 2026, https://stoa.school/course/discrete-math.
- Chicago
Stoa. “Discrete Mathematics.” Stoa. Accessed September 1, 2026. https://stoa.school/course/discrete-math.
§ 02 — Curriculum
5 modules.
Each module is a small unit. Most read in sequence — but a determined reader can begin anywhere.
- M ISets and RelationsSet theory, binary relations, order, and equivalence3 articles
18 minBegin → - M IIBoolean Functions and Post's TheoremCompleteness of systems of Boolean functions, closed classes3 articles
18 minBegin → - M IIIGraph TheoryConnectivity, trees, planarity, colorings3 articles
18 minBegin → - M IVCombinatoricsInclusion–exclusion principle, generating functions3 articles
18 minBegin → - M VAutomata and Formal LanguagesFinite automata, regular languages, Kleene’s theorem3 articles
18 minBegin →
§ 03 — Learning outcomes
4 outcomes.
Apply methods of mathematical logic and set theory
Solve combinatorial problems involving permutations, combinations, and the inclusion–exclusion principle
Analyze graphs and determine paths, spanning trees, and flows
Apply number-theoretic algorithms and assess algorithmic complexity
§ 04 — Practices