Lesson 1 of 11Article18 minFREE
Logic, Quantifiers & Proof Methods
Discrete math is the language of computer science proofs, algorithms, and digital logic. Start with propositions, connectives, and what counts as a valid argument.
Precision as a superpower
Discrete math is the language of computer science proofs, algorithms, and digital logic. Start with propositions, connectives, and what counts as a valid argument.
- Direct proof: assume p, derive q.
- Contrpositive: prove ¬q → ¬p.
- Contradiction: assume ¬claim and derive absurdity.
- Induction: base case + inductive step for statements about ℕ.
A single counterexample kills a universal claim. Existence needs only one constructive (or non-constructive) witness.