Proof by Deduction Exam Questions: A-Level Maths
Proof by deduction exam questions A-Level Maths, with three worked solutions, method marks, common mistakes and focused exam practice advice for students.

A proof question can feel different from the rest of an A-Level Maths paper. There is no single numerical answer waiting at the bottom. Instead, every line has to justify the next.
To tackle proof by deduction exam questions A-Level Maths students encounter, begin with an accepted definition, translate it into algebra and build a logical chain towards the conclusion. You are showing why a statement must always hold.
Imagine a student, Maya, revising deduction. Testing numbers helps her understand a claim, but examples provide evidence, not a general proof.
A student discovers that confidence in a proof still needs mathematical evidence
The proof by deduction checklist
Use this sequence:
- Identify what must be proved.
- Introduce an integer, usually nnn or kkk.
- Write the relevant definition algebraically.
- Simplify or factorise without assuming the conclusion.
- Rewrite the result in the required form.
- Finish with a precise conclusion.
An even integer has the form 2k2k2k, while an odd integer has the form 2k+12k+12k+1, where k∈Zk\in\mathbb{Z}k∈Z. A multiple of mmm has the form mqmqmq for an integer qqq.
Before writing any algebra, identify the scope of the claim. Does it concern every integer, only positive integers, or integers satisfying another condition? Your opening line should reflect that scope. A proof about positive integers alone does not automatically establish a statement about all integers, so keep the stated domain visible throughout your reasoning.
Explore these foundations in the A-Level structure and methods of proof lesson. For an algebra refresher, use the AS Level factorising lesson.
Question one: proving that an odd square is odd
Question: Prove by deduction that the square of any odd integer is odd.
Maya checks 32=93^2=932=9 and 52=255^2=2552=25. Both results are odd, but two examples cannot cover every odd integer. She starts with the definition instead.
Let the odd integer be 2k+12k+12k+1, where k∈Zk\in\mathbb{Z}k∈Z.
Squaring gives
(2k+1)2=4k2+4k+1.(2k+1)^2=4k^2+4k+1.(2k+1)2=4k2+4k+1.Rearranging into the standard form of an odd integer:
4k2+4k+1=2(2k2+2k)+1.4k^2+4k+1=2(2k^2+2k)+1.4k2+4k+1=2(2k2+2k)+1.Since kkk is an integer, 2k2+2k2k^2+2k2k2+2k is also an integer. Therefore, the square has the form 2m+12m+12m+1 for an integer mmm, so it is odd.
Notice that the final rearrangement is not extra decoration. It connects the calculation to the definition of an odd integer. When choosing your last algebraic line, ask what form would make the requested property immediately recognisable. That question often reveals whether you have finished the proof or merely simplified an expression without completing the argument.
Indicative marking points
- Represents an arbitrary odd integer correctly.
- Expands and rewrites its square in odd form.
- Explains why the result is odd.
These are illustrative checkpoints, not an official mark scheme. Exact allocations depend on the question and exam board.
Question two: proving that n2+nn^2+nn2+n is even
Question: Prove that n2+nn^2+nn2+n is even for every integer nnn.
Maya considers splitting the proof into odd and even cases. That works, but factorising gives a shorter route.
For n∈Zn\in\mathbb{Z}n∈Z,
n2+n=n(n+1).n^2+n=n(n+1).n2+n=n(n+1).The integers nnn and n+1n+1n+1 are consecutive. One must be even, so their product is even.
Hence, n2+nn^2+nn2+n is even for every integer nnn.
Indicative marking points
- Establishes that nnn is an integer.
- Factorises the expression correctly.
- Explains why the product is even and concludes.
The phrase “one must be even” supplies the logical connection. Do not leave the examiner to infer your reason from the factorisation alone.
This argument also covers zero and negative integers because consecutive integers still alternate between even and odd. There is no need to add separate numerical checks for those values. The strength of the reasoning is its generality: the same explanation applies across the whole stated domain, rather than relying on a collection of reassuring examples.
Recognising factors is useful across algebra. The Factor Theorem lesson and exam-style questions develop this broader skill, although the theorem is unnecessary here.
Question three: proving divisibility by 666
Question: Prove by deduction that n3−nn^3-nn3−n is divisible by 666 for every integer nnn.
For n∈Zn\in\mathbb{Z}n∈Z, factorising gives
n3−n=n(n2−1)=n(n−1)(n+1).n^3-n=n(n^2-1)=n(n-1)(n+1).n3−n=n(n2−1)=n(n−1)(n+1).This is the product of three consecutive integers:
(n−1)n(n+1).(n-1)n(n+1).(n−1)n(n+1).At least one is even, so the product is divisible by 222. Exactly one is divisible by 333, so the product is also divisible by 333.
Since 222 and 333 are coprime, any integer divisible by both is divisible by 666. Therefore,
6∣(n3−n)6\mid(n^3-n)6∣(n3−n)for every integer nnn.
Indicative marking points
- Factorises into three consecutive integer factors.
- Justifies divisibility by 222 and by 333.
- Uses these facts to establish divisibility by 666.
The coprime condition matters: divisibility by two numbers does not always imply divisibility by their product. Here, it completes the argument.
Common proof by deduction mistakes
Testing examples instead of proving the claim
Trying n=1n=1n=1, n=2n=2n=2 and n=3n=3n=3 may suggest a pattern, but it cannot establish a statement about every integer. Move from numerical exploration to a general expression.
Assuming the conclusion
If asked to prove that an expression is even, do not begin by declaring that it equals 2k2k2k. That is what you need to establish. Start from the given expression or a valid definition.
Forgetting the integer condition
Writing 2k+12k+12k+1 represents an odd integer only when kkk is an integer. State k∈Zk\in\mathbb{Z}k∈Z when introducing the expression.
Ending without explaining the result
Correct algebra still needs interpretation. State why your final expression is odd, even or divisible by the required integer.
Doing unnecessary algebra
Look for factors, consecutive integers and standard forms before splitting into cases. Choose a route whose steps you can justify clearly.
How to practise exam-style deduction
Use the MathsGenie A Level Maths revision hub or AS Level Maths revision hub, choosing your course. Attempt questions without notes, then compare your reasoning with the solution or mark scheme.
Review each proof using three prompts: did I define the objects correctly, justify every deduction and prove the requested conclusion?
In your revision notes, record the missing reason rather than copying the entire solution. Perhaps you recognised the factorisation but forgot to explain consecutive integers. Reattempt that question later without looking at your correction. This makes the next attempt a check of independent reasoning, not simply a test of whether the worked solution looks familiar.
If the notation feels unfamiliar, revisit the GCSE proof revision lesson before returning to A-Level questions.
Maya now has a repeatable sequence: define, manipulate, justify and conclude. Build your own confidence with the MathsGenie proof lesson and practice resources, then apply that sequence independently.



