What you'll learn

35 lessons in Discrete Math

SetsPropositional logicMathematical inductionRelations & equivalence classesFunctions & cardinalityStrings, sequences, recurrencesPredicate logic & quantifiersProof techniquesPartial orders, lattices, Hasse diagramsStars and bars & counting principlesFinite automataComputability & Turing machinesComplexity classes P, NP, NP-completeFormal proofs & natural deductionProof: $\sqrt 2$ irrational + infinitude of primesPigeonhole pleasuresHalting problem proofRegular expressionsSolving linear recurrencesAsymptotic notation: big-O, Θ, ΩGenerating functionsThe Master theoremMöbius inversionContext-free grammars & the Chomsky hierarchyPushdown automataReductions & undecidabilityNP-completeness & Cook–LevinSpace complexity & PSPACEApproximation algorithms & hardnessRandomized algorithms & BPPThe polynomial hierarchyInteractive proofs & the PCP theoremKolmogorov complexityAmortized analysisParameterized complexity & FPT

How Erudia teaches

Built to be understood — and remembered.

Every idea is taught with motivation and a worked example before the drills, and an FSRS spaced-repetition engine schedules each review for the moment just before you'd forget it. A short placement check finds what you already know, so you start Discrete Math exactly where it's useful.

Start Discrete Math →

Related Discrete Mathematics subjects

Combinatorics Graph theory Boolean algebra & logic Diophantine Approximation Algebraic Number Theory Number Theory