- Home
- Courses
- AQA A-Level Maths
- Proof
- Proof by Exhaustion
Proof by Exhaustion
Proof by exhaustion breaks a statement into every possible case and checks each one. Used carelessly it looks like “testing examples” — used correctly, the cases are complete and finite, so checking them all is a genuine proof.
The big picture
Exhaustion is the method students most often misunderstand, because on the surface it resembles the thing we just banned — trying examples. The difference is completeness. Testing leaves infinitely many untested. But if you can split every possibility into a number of cases that together miss nothing, then checking each case really does settle the whole claim. The insight that unlocks it: infinitely many integers can be sorted into just a few boxes — even or odd, or “remainder 0, 1 or 2 on division by 3”.
What you'll be able to do
- Recognise when a statement can be split into a finite, complete set of cases
- Group infinitely many integers into a few classes (parity or remainders)
- Write each case as a self-contained mini-proof and combine them
- Judge when exhaustion is appropriate — and when it cannot work
Cases that leave nothing out
The engine of exhaustion is a set of cases: a way of dividing every possibility so that each one falls into exactly one case and none is missed. Prove the statement in every case and you have proved it in general — because there is nothing outside your cases.
The word “complete” is doing all the work. “The number is 1, 2 or 3” is only a valid exhaustion if those really are the only options. If a fourth possibility exists, checking the first three proves nothing.
This is the one situation where checking cases is a valid proof — not because you checked many, but because you checked of them. Quantity is irrelevant; completeness is everything.
When the cases are already finite
Sometimes a statement only concerns a handful of values, and you can simply run through them. This is exhaustion at its most direct — but you must be systematic and visibly cover every option.
Example 1Prove that no square number ends in the digit 2, 3, 7 or 8.
Tip — When you reduce an “all integers” claim to “all possible last digits”, say so explicitly — that sentence is what turns 10 checks into a complete proof.
Turning infinitely many numbers into a few cases
The powerful version of exhaustion handles statements about all integers by sorting them into classes. Every integer is either even or odd — two classes, no exceptions. Every integer leaves a remainder of 0, 1 or 2 when divided by 3 — three classes. Prove the statement for each class and every integer is covered.
Example 1Prove that is even for every integer .
Example 2Prove that the square of any integer is either a multiple of 4 or one more than a multiple of 4.
Notice why this beats testing: the two lines “” and “” between them every integer, so proving both is proving all infinitely many at once.
When exhaustion won’t work
Exhaustion needs a finite number of cases. You cannot exhaust a statement about all real numbers by cases, nor prove something for “all primes” by listing them, because those sets never end. If your cases are infinite, you need deduction or contradiction instead.
The honest test: before you start, can you name every case and be sure none is missing? If yes, exhaustion is valid. If the list would run forever, choose another method.
Think like an examiner
- State clearly why your cases are — e.g. “every integer is even or odd”. Without that line, an examiner cannot tell exhaustion from example-testing.
- Each case must be a proper mini-proof with its own algebra, not just a number that happens to work.
- Finish with a combining statement: “in both cases… and these cases cover every integer, so…”. That sentence earns the final mark.
- Exhaustion questions usually cap at a small number of cases (2 or 3). If your split produces many cases, you have probably chosen the wrong classification.
Common misconceptions
Complete case-splits
Stretch yourself
Prove by exhaustion that for every integer , the number is either a multiple of 3 or one more than a multiple of 3 — it is never two more than a multiple of 3.
Hint — Split every integer into three cases: , , . Square each and simplify to reveal a multiple of 3, plus a remainder.
Reveal solution
Questions students ask
How is proof by exhaustion different from just testing examples?
How can I check infinitely many integers with only two or three cases?
When should I avoid exhaustion?
How many cases is “too many”?
Key takeaways
- Exhaustion proves a statement by checking a complete, finite set of cases.
- It is valid because the cases cover every possibility — not because there are many of them.
- Sort infinitely many integers into classes: even/odd, or remainders mod .
- Write each case as its own mini-proof, then combine with a completeness statement.
- Never use exhaustion where the cases are infinite (all reals, all primes).
How this fits the course
Related
Leads to
Test yourself
Answer a few questions, then review anything you missed.
Prefer paper? Open the written self-check
Answer each question before opening its answer. This self-check does not record a quiz score.
Proof by exhaustion is valid because:
- the cases together cover every possibility
- a large number of cases are checked
- the first few cases all work
- it uses algebra
Show answer and explanation
Answer: the cases together cover every possibility
Completeness is the key: the cases must leave nothing out.
Which is a complete case-split for every integer ?
- or
- or
- or
Show answer and explanation
Answer: or
Even or odd covers every integer exactly once. The mod-3 option is missing the case.
The possible final digits of a square number are:
- any digit
Show answer and explanation
Answer:
Squaring each last digit – produces only these six final digits.
Why can’t exhaustion prove a statement about all real numbers?
- There are infinitely many cases that cannot be listed
- Real numbers are too large
- Exhaustion only works for even numbers
- It can, with enough cases
Show answer and explanation
Answer: There are infinitely many cases that cannot be listed
Exhaustion needs a finite, complete list of cases; the reals cannot be split that way.
When is odd, equals:
Show answer and explanation
Answer:
With : , which is even.
A valid exhaustion proof for “all integers” must, above all, ensure the cases are:
- complete and non-overlapping
- as numerous as possible
- all even
- chosen at random
Show answer and explanation
Answer: complete and non-overlapping
Each possibility must land in exactly one case, with none missing.
Keep practising
Start with the quiz above to check the key ideas. You can also choose another topic from the practice library.
Related lessons
All 6 lessons- Same chapterThe Structure of a Mathematical ProofWhat a proof actually is: statements, conditions, the logic symbols ⇒, ⇐ and ⇔, and the standard number sets.
- Same chapterProof by DeductionProving a result for all cases with a chain of algebra that starts from definitions. This is the method most A-Level proof questions expect.
- Same chapterDisproof by Counter-ExampleWhy a single well-chosen example can destroy a claim, and how to hunt for one efficiently.
Put the methods into practice: see how A-Level maths duels work. An account is required to play; the overview and sample are public.