Proof by Exhaustion A-Level Maths Explained
Proof by exhaustion A-Level Maths explained with a clear method, worked examples, common mistakes and exam-style questions for confident revision.

A proof can feel strangely different from the rest of A-Level Maths. There is no familiar instruction to solve, differentiate or integrate. Instead, you must build an argument with no gaps.
For a sixth-form student meeting proof by exhaustion A-Level Maths questions, the central idea is reassuringly simple: identify every possible case, test each one logically, and state why those cases exhaust all possibilities. If every case works, the result is proved.
The arithmetic is often easy. The real skill is showing that nothing has been missed.
Proof by exhaustion at a glance
Use this checklist whenever you meet a finite proof question:
- Identify the exact set of permitted values or cases.
- Explain why the list is complete.
- Check the claim for every case.
- Present the work systematically.
- Finish with a conclusion that refers back to the original statement.
Proof by exhaustion is suitable only when the possibilities can be reduced to a finite and manageable list. Checking several examples from an infinite set is evidence, not proof.
You can review this alongside MathsGenie's A-Level structure and methods of proof lesson, which brings together the question bank, videos and flashcards for the topic.
What is proof by exhaustion?
Proof by exhaustion proves a statement by dividing the problem into all possible cases and establishing the result separately for each one.
Suppose an integer nnn is known to satisfy 1≤n≤41 \leq n \leq 41≤n≤4. There are exactly four possibilities:
n=1,n=2,n=3,n=4. n=1,\quad n=2,\quad n=3,\quad n=4. n=1,n=2,n=3,n=4.If a statement about nnn is true in all four cases, it is true for every integer in the stated interval. There is nowhere else for a counterexample to hide.
That final detail matters. Writing down four convenient values would not be enough unless the condition guarantees that they are the only values possible.
A student detective checks the cupboard of unchecked cases
A reliable proof by exhaustion method
Imagine a student, Sam, reading a proof question for the first time. Sam's instinct is to begin calculating immediately. A better habit is to pause and draw a boundary around the problem.
Find the restriction
Look for wording that creates a finite set, such as:
- nnn is an integer and 2≤n≤62 \leq n \leq 62≤n≤6;
- ppp is a prime number less than 101010;
- two integers have a fixed sum;
- an integer leaves one of a small number of possible remainders.
List every valid case
Apply every restriction carefully. If ppp is prime and p<10p<10p<10, the valid cases are
p∈{2,3,5,7}. p\in\{2,3,5,7\}. p∈{2,3,5,7}.The numbers 111 and 999 are below 101010, but neither is prime.
Test the claim case by case
Keep the same calculation or logical test for each case. A table can be useful when it makes completeness easy to see, but full mathematical statements are still needed.
State the conclusion
End by explaining both that the cases cover every possibility and that the result holds in each case. This turns a collection of calculations into a proof.
Once you have this four-stage method, use the MathsGenie proof Lessons and Question Bank to practise recognising and checking the complete set of cases.
Proof by exhaustion worked examples
Proving a divisibility statement
Claim: If nnn is an integer satisfying 1≤n≤41\leq n\leq41≤n≤4, then n2+nn^2+nn2+n is even.
The possible values are
n∈{1,2,3,4}. n\in\{1,2,3,4\}. n∈{1,2,3,4}.Check each value:
n=1:n2+n=12+1=2,n=2:n2+n=22+2=6,n=3:n2+n=32+3=12,n=4:n2+n=42+4=20.\begin{aligned} n=1 &: \quad n^2+n=1^2+1=2,\\ n=2 &: \quad n^2+n=2^2+2=6,\\ n=3 &: \quad n^2+n=3^2+3=12,\\ n=4 &: \quad n^2+n=4^2+4=20. \end{aligned}n=1n=2n=3n=4:n2+n=12+1=2,:n2+n=22+2=6,:n2+n=32+3=12,:n2+n=42+4=20.Each result is divisible by 222. Since 111, 222, 333 and 444 are all the possible integer values of nnn, n2+nn^2+nn2+n is even for every permitted value. Therefore, the claim is proved by exhaustion.
There is a more general algebraic proof because n2+n=n(n+1)n^2+n=n(n+1)n2+n=n(n+1) is the product of consecutive integers. However, the exhaustive argument is valid for the finite domain given.
Exhausting possible pairs
Claim: If aaa and bbb are positive integers with a<ba<ba<b and a+b=7a+b=7a+b=7, then ababab is even or a multiple of 333.
Because aaa and bbb are positive integers, a<ba<ba<b, and their sum is fixed, the complete list is
(a,b)=(1,6),(2,5),(3,4). (a,b)=(1,6),\quad(2,5),\quad(3,4). (a,b)=(1,6),(2,5),(3,4).Now test the products:
1×6=6,2×5=10,3×4=12.\begin{aligned} 1\times6&=6,\\ 2\times5&=10,\\ 3\times4&=12. \end{aligned}1×62×53×4=6,=10,=12.The values 666, 101010 and 121212 are all even, while 666 and 121212 are also multiples of 333. Thus, every possible pair gives a product that is even or a multiple of 333. The claim is proved by exhaustion.
Notice why (4,3)(4,3)(4,3) is not checked separately. The condition a<ba<ba<b has already fixed the order. Efficient exhaustion checks every distinct valid case, not duplicated cases.
How to answer proof by exhaustion exam questions
In an exam, method marks depend on communicating a complete argument, not merely obtaining correct numerical results. A strong answer usually follows this pattern:
- Define the cases: “Since nnn is an integer and 2≤n≤52\leq n\leq52≤n≤5, n∈{2,3,4,5}n\in\{2,3,4,5\}n∈{2,3,4,5}.”
- Check each case: Substitute or reason accurately for every listed value.
- Interpret the results: Explain why each result has the required property.
- Conclude: Confirm that all possible cases have been considered.
When attempting proof by exhaustion exam questions, underline restrictive words such as “integer”, “positive”, “prime” and “distinct”. One word can change the entire list.
For broader practice, MathsGenie's AS Level Maths revision hub provides exam-board resources including past papers and mark schemes. The legacy AS proof resources also contain lessons, exam-style questions, booklets and worked solutions, although you should always match practice to your current specification.
Common mistakes in proof by exhaustion
Checking examples instead of all cases
Testing n=1n=1n=1, n=2n=2n=2 and n=3n=3n=3 does not prove a claim for every positive integer. The domain is infinite, so the argument is incomplete.
Missing a valid possibility
If ppp is prime and p<10p<10p<10, omitting p=2p=2p=2 leaves a gap. Write the complete set before doing any calculations.
Including invalid cases
Restrictions work together. For positive integers satisfying a<ba<ba<b and a+b=7a+b=7a+b=7, the pair (0,7)(0,7)(0,7) is invalid because 000 is not positive.
Forgetting to explain why the cases are exhaustive
A bare table of calculations may suggest the right idea, but a sentence such as “These are all possible values because...” makes the logic explicit.
Giving no final conclusion
A proof should close the argument. State what the checked results establish and why no other cases remain.
Exam-style practice
Try these without looking back at the worked examples.
Question A: An integer nnn satisfies −2≤n≤2-2\leq n\leq2−2≤n≤2. Prove by exhaustion that n2+n+2n^2+n+2n2+n+2 is positive.
Question B: The integer ppp is prime and p<8p<8p<8. Prove by exhaustion that p2−1p^2-1p2−1 is divisible by 333 for every possible value except one, and identify the exception.
Question C: The positive integers aaa and bbb satisfy a≤ba\leq ba≤b and a+b=8a+b=8a+b=8. Determine every possible pair and prove by exhaustion that ab≤16ab\leq16ab≤16.
For each question, mark your own work with three checks: complete case list, correct test, explicit conclusion. That habit matters because a correct idea can still be weakened by a missing case or an unstated assumption.
Turn the method into exam confidence
Sam's progress does not come from memorising a polished example. It comes from repeatedly deciding what the possible cases are, checking them cleanly, and closing the argument without gaps. Knowing the method is the first step; recognising when to use it under exam pressure takes deliberate practice.
Start the MathsGenie proof Lessons and Question Bank and turn this proof by exhaustion method into a routine you can use in your A-Level Maths exam.



