A proof-centered discrete mathematics course covering logic, sets, relations, induction, number theory, counting, graphs, state machines, recurrences, and discrete probability.
A proof-centered discrete mathematics course covering logic, sets, relations, induction, number theory, counting, graphs, state machines, recurrences, and discrete probability.
Built for independent progress first, then tutor support where the student gets stuck.
Practice: Formalize ten claims, test validity with truth tables or inference rules, and repair every ambiguous statement.
Practice: Complete one proof by each major method and annotate the logical hinge in every argument.
Practice: Classify functions and relations from definitions, then prove two classifications from first principles.
Practice: Prove a summation or divisibility claim by induction and trace a recursive definition on a small input.
Need the complete source list and remaining units? Open the full Discrete Mathematics curriculum.
Start with the public curriculum. If a unit stalls, get targeted one-on-one support from a tutor.