Algebra · Algebraic proof
1 / 9
Expressing generality — the language of proof
Why testing examples proves nothing, how 2n, 2n + 1 and n, n + 1, n + 2 encode "any even", "any odd" and "consecutive", and when one counterexample settles everything.
Algebra · Algebraic proof
Expressing generality — the language of proof
Why testing examples proves nothing, how 2n, 2n + 1 and n, n + 1, n + 2 encode "any even", "any odd" and "consecutive", and when one counterexample settles everything.
Why it works
"Show this works for 3, for 7, for 100" is evidence, not proof — the claim is about EVERY number, and no pile of examples covers them all. Algebra's letters do what examples can't: stands for any integer at once, so one calculation with is every calculation simultaneously.The vocabulary — the standard encodings, with any integer:
- any even number: (a multiple of 2, by construction);
- any odd number: (one more than an even);
- consecutive integers: ;
- consecutive EVEN numbers: (they step
- consecutive ODD numbers: ;
- any multiple of : .
A tiny demonstration. The sum of two consecutive integers: — one more than a multiple of 2 — odd, for every at once. That's the whole game: encode, expand, read off the structure.
Disproving needs only ONE counterexample. "The sum of two primes is always even" dies on a single case: , odd. To wreck a "for all" claim, one honest failure is a complete proof — hunt near the special cases (the prime 2, zero, negatives, ).
Why the exam cares. Proof questions award marks for the ENCODING (right general forms), the ALGEBRA (expansion/factorising), and the CONCLUSION (a sentence connecting the result to the claim). Miss the encoding and nothing after it can score.