Proof by Exhaustion Exam Questions: A-Level Maths
Proof by exhaustion exam questions for A-Level Maths, with three worked examples, method marks, common errors and focused exam practice.

A proof can feel obvious in your head and still earn very little on paper. That is the difficulty many students meet with proof by exhaustion exam questions in A-Level Maths. The calculations are often short. The real skill is showing that every permitted case has been checked and then stating a conclusion that follows from those checks.
Imagine a student called Sam facing three proof questions. Sam's first instinct is to test a couple of values and write, “Therefore it is true.” But proof by exhaustion needs more discipline: identify the finite set of possibilities, examine every case, and conclude explicitly.
This guide follows Sam through that process, with illustrative method marks showing how a clear solution could be rewarded. Actual allocations vary by paper, so always use the official mark scheme for a specific past-paper question.
Proof by exhaustion checklist
Use proof by exhaustion when the conditions leave a finite and manageable number of cases.
For each question:
- identify all possible cases from the given conditions;
- explain why your list is complete;
- test every case systematically;
- show enough working to verify each result;
- give a final sentence linked to the original claim.
A compact structure is:
possible cases→check each case→conclusion.\text{possible cases}\rightarrow\text{check each case}\rightarrow\text{conclusion}.possible cases→check each case→conclusion.This differs from checking examples. Three successful examples do not prove a statement about infinitely many integers. Exhaustion works only when the restrictions reduce the problem to a finite list which you can check completely.
You can review this alongside the A-Level structure and methods of proof lesson, which brings together the lesson, question bank, videos and flashcards for the topic.
Question one: exhausting possible integers
Sam begins with a question where the finite range is stated directly.
Exam-style question
An integer nnn satisfies 1≤n≤41\leq n\leq 41≤n≤4. Prove by exhaustion that n2+n+11n^2+n+11n2+n+11 is prime.
Step-by-step solution
The possible integer values are
n=1,2,3,4.n=1,2,3,4.n=1,2,3,4.Sam checks each one:
n=1:n2+n+11=1+1+11=13,n=2:n2+n+11=4+2+11=17,n=3:n2+n+11=9+3+11=23,n=4:n2+n+11=16+4+11=31.\begin{aligned} n=1 &: \quad n^2+n+11=1+1+11=13,\\ n=2 &: \quad n^2+n+11=4+2+11=17,\\ n=3 &: \quad n^2+n+11=9+3+11=23,\\ n=4 &: \quad n^2+n+11=16+4+11=31. \end{aligned}n=1n=2n=3n=4:n2+n+11=1+1+11=13,:n2+n+11=4+2+11=17,:n2+n+11=9+3+11=23,:n2+n+11=16+4+11=31.Each result is prime. Since 111, 222, 333 and 444 are all the possible integer values of nnn, n2+n+11n^2+n+11n2+n+11 is prime for every permitted value of nnn.
Illustrative method marks
- M1: States all four possible integer values.
- A1: Correctly obtains 131313, 171717, 232323 and 313131.
- A1: Recognises that all four results are prime.
- C1: Gives a conclusion covering every permitted value.
Sam's improvement is small but important. Instead of writing only a list of calculations, Sam explains why those calculations settle the claim.
Once this three-part method feels familiar, use the Maths Genie lesson and question bank to practise recognising finite case sets without having to build a worksheet yourself.
Question two: finding the cases before testing them
The second question does not hand Sam a list. Creating the complete list is part of the proof.
Exam-style question
Positive integers aaa and bbb satisfy a<ba<ba<b and ab=12ab=12ab=12. Prove by exhaustion that a+ba+ba+b is odd or prime.
Step-by-step solution
Because aaa and bbb are positive integers and a<ba<ba<b, the possible factor pairs of 121212 are
(a,b)=(1,12),(2,6),(3,4).(a,b)=(1,12),(2,6),(3,4).(a,b)=(1,12),(2,6),(3,4).Now evaluate a+ba+ba+b in every case:
(1,12):a+b=13, which is prime,(2,6):a+b=8,(3,4):a+b=7, which is odd and prime.\begin{aligned} (1,12)&: \quad a+b=13, \text{ which is prime},\\ (2,6)&: \quad a+b=8,\\ (3,4)&: \quad a+b=7, \text{ which is odd and prime}. \end{aligned}(1,12)(2,6)(3,4):a+b=13, which is prime,:a+b=8,:a+b=7, which is odd and prime.There is a problem: 888 is neither odd nor prime. The proposed statement is false.
That is not a failed proof. It is the correct mathematical outcome. The case (a,b)=(2,6)(a,b)=(2,6)(a,b)=(2,6) is a counterexample.
Illustrative method marks
- M1: Finds the complete set of factor pairs satisfying a<ba<ba<b.
- A1: Calculates the three sums correctly.
- C1: Identifies (2,6)(2,6)(2,6) as a counterexample and rejects the claim.
This question teaches an exam habit that matters beyond exhaustion: do not force the requested conclusion when your working contradicts it. Recheck the arithmetic, then report the counterexample precisely.
A student detective checks everyone in the all possible cases room
Question three: a divisibility proof
In the final question, Sam must see that “odd digit” creates a short, finite list.
Exam-style question
The positive integer nnn is an odd single-digit number. Prove by exhaustion that n2−1n^2-1n2−1 is divisible by 888.
Step-by-step solution
The positive odd single-digit integers are
n=1,3,5,7,9.n=1,3,5,7,9.n=1,3,5,7,9.Check each case:
n=1:n2−1=0=8×0,n=3:n2−1=8=8×1,n=5:n2−1=24=8×3,n=7:n2−1=48=8×6,n=9:n2−1=80=8×10.\begin{aligned} n=1 &: \quad n^2-1=0=8\times0,\\ n=3 &: \quad n^2-1=8=8\times1,\\ n=5 &: \quad n^2-1=24=8\times3,\\ n=7 &: \quad n^2-1=48=8\times6,\\ n=9 &: \quad n^2-1=80=8\times10. \end{aligned}n=1n=3n=5n=7n=9:n2−1=0=8×0,:n2−1=8=8×1,:n2−1=24=8×3,:n2−1=48=8×6,:n2−1=80=8×10.Every possible result is a multiple of 888. Therefore n2−1n^2-1n2−1 is divisible by 888 for every positive odd single-digit integer nnn.
Illustrative method marks
- M1: Lists all positive odd single-digit values.
- M1: Substitutes every value into n2−1n^2-1n2−1.
- A1: Expresses each result as 8k8k8k for an integer kkk.
- C1: Gives a complete divisibility conclusion.
Writing each result as 888 multiplied by an integer makes the divisibility visible. It is stronger than presenting the outputs and expecting the examiner to infer the connection.
How to use a proof by exhaustion past paper
A proof by exhaustion past paper question should be attempted under realistic conditions before you read its solution. Give yourself a blank page, identify the case set, and write a formal conclusion.
Then compare your answer with the proof by exhaustion markscheme. Look beyond whether your numbers match. Ask:
- Did I justify that my list was complete?
- Did I test every case allowed by the conditions?
- Did I state what each result demonstrated?
- Did my conclusion use the language of the claim?
The A-Level Maths revision hub provides access to revision resources, while the AS Level Maths revision hub includes exam-board routes to past papers and mark schemes. Check that any paper matches your course and current specification before using it as timed practice.
Common mistakes in proof by exhaustion
Checking only convenient values
If nnn can be 111, 222, 333 or 444, checking 111 and 444 is not enough. Exhaustion means checking every permitted case.
Missing a case at an endpoint
Read inequalities carefully. The condition 1≤n≤41\leq n\leq41≤n≤4 includes both endpoints, while 1<n<41<n<41<n<4 does not.
Forgetting restrictions on ordered pairs
Conditions such as a<ba<ba<b, a≤ba\leq ba≤b or a≠ba\neq ba=b change which pairs are possible. State how you used the restriction.
Treating evidence as a universal proof
Testing several values cannot prove a claim over all integers. If infinitely many cases remain, another method, such as direct proof, contradiction or induction, may be needed.
Omitting the conclusion
Calculations are evidence, but the final sentence connects them to the proposition. Use wording such as, “These are all possible cases, and the statement holds in each case. Therefore the result is proved.”
Exam-style practice
Try these without looking back at the worked solutions:
- An integer nnn satisfies 2≤n≤62\leq n\leq62≤n≤6. Prove by exhaustion that n2+nn^2+nn2+n is even.
- Positive integers ppp and qqq satisfy p<qp<qp<q and pq=18pq=18pq=18. Determine by exhaustion whether p+qp+qp+q is always odd.
- The integer rrr is even and 0≤r<100\leq r<100≤r<10. Prove by exhaustion that r2r^2r2 is divisible by 444.
For each one, leave three visible parts on the page: the complete case list, the checks and the conclusion. That structure makes your logic easier to follow and gives each potential method mark somewhere to land.
Turn the method into exam practice
Sam did not need a clever trick. The change was learning to identify every case, record each check and finish the argument clearly. Knowing that structure is the first step; applying it accurately to unfamiliar exam questions is the gap that practice closes.
Start with the Maths Genie structure and methods of proof lesson, then open its Question Bank and work through proof by exhaustion questions with the same case-check-conclusion structure.



