We rebuild confidence with truth tables, induction, and counting arguments before touching code. Each module ends with a short proof clinic where you defend assumptions aloud.
Included
Weekly proof walkthroughs on a shared whiteboard
Printed workbook with blank proof scaffolds
Office-hour blocks for stuck induction steps
Peer review pairs for written arguments
Checker scripts for small finite structures only
Office templates for documenting lemmas
Capstone memo tying three lemmas to one algorithm
Outcomes
Draft induction proofs without skipping base cases
Translate informal specs into predicates safely
Spot when a counting argument is the right tool
Nino Kvaratskhelia
Former university tutor focused on first-year logic transitions.
FAQ
Do I need prior proof experience?
Comfort with high-school algebra is enough. We start from notation and build slowly.
Is coding required?
Optional Python checks appear, but grading focuses on written reasoning.
What is not included?
We do not cover probability distributions or continuous mathematics—that sits in a separate track.
Experience notes
“The induction template from Discrete Structures Intensive is still taped above my desk; it saved my graph correctness write-up.”
Luka
“Clear readings, though the relations module felt dense. Mentor notes on my two-column proofs were the standout.”
