Apply Discrete Mathematics Through Formal Proofs

8 weeks · 0 milestones

Produce written solutions to 30+ proof exercises spanning propositional logic, mathematical induction, graph theory, and combinatorics — not just correct answers, but proofs with valid structure (base case, inductive step, conclusion) that a mathematician would accept. Each proof must show your reasoning, not just the result. Proof: the submitted exercise set reviewed by a CS lecturer or maths researcher who also presents 2–3 unseen claims during the review and asks you to prove or disprove them live — the live reasoning is what demonstrates understanding rather than memorisation.

Sign in to start this outcome and track your progress publicly.