Paper 1 · Module
Proof
Deduction, exhaustion and counterexample
A proof must work for every case, not just the ones you tried. Deduction uses algebra for a general case; exhaustion splits all possibilities into a few cases and checks each; and one single counterexample is enough to show a statement is false.
≈ 30 minProof by contradiction
To prove a statement, assume it is false and show that this leads to something impossible. The assumption must have been wrong, so the statement is true. The two famous examples are that is irrational and that there are infinitely many primes.
≈ 35 min