Proof by Deduction A-Level Maths Explained
Proof by deduction A-Level Maths explained with a clear method, worked examples, exam-style practice and common mistakes to help you write rigorous proofs.

A proof can feel strange because the final statement is already printed in the question. You are not being asked to discover the answer. You are being asked to build an argument that leaves no room for doubt.
For a hypothetical sixth-form student called Maya, that distinction changes everything. She can manipulate algebra confidently, but her early proofs read like calculations without explanations. The missing ingredient is logic.
Proof by deduction A-Level Maths questions require you to begin with accepted facts, definitions or assumptions and move through justified steps to the required conclusion. The algebra matters, but so do the words connecting it.
Proof by deduction at a glance
A reliable direct-proof method is:
- identify exactly what must be proved;
- represent the given information algebraically;
- work forwards using valid algebra and known definitions;
- explain why each important deduction follows;
- finish by explicitly stating that the required result has been proved.
This is sometimes called direct proof. Unlike proof by contradiction, you do not assume that the conclusion is false. You start from what is known and proceed directly towards it.
What makes a deduction a proof?
A deduction is a conclusion forced by earlier information. For example, if nnn is even, then there is an integer kkk such that
n=2k.n=2k.n=2k.This is not merely a convenient substitution. It is the definition of an even integer. Any conclusion that follows correctly from n=2kn=2kn=2k must therefore hold for every even integer.
That word, every, is important. Testing n=2n=2n=2, n=4n=4n=4 and n=6n=6n=6 may suggest a pattern, but examples cannot prove a universal statement. There could always be an untested value for which it fails. Algebra deals with all permitted values at once.
You can review the formal language and different proof structures through the AQA structure and methods of proof lessons or the OCR proof video lessons.
A step-by-step structure for direct proof
Most proof by deduction exam questions can be organised into four stages.
Translate the condition
Convert words such as odd, even, consecutive or divisible into algebra.
- An even integer can be written as 2k2k2k.
- An odd integer can be written as 2k+12k+12k+1.
- Consecutive integers can be written as kkk and k+1k+1k+1.
- A multiple of mmm can be written as mkmkmk.
In each case, state that k∈Zk\in\mathbb{Z}k∈Z. This confirms that the parameter is an integer.
Develop the argument
Substitute the representation and simplify. Work towards a recognisable form rather than manipulating expressions without direction.
Justify the crucial step
A line of algebra may show what an expression equals, but a proof should explain why that form establishes the claim. If the result is 2r+12r+12r+1 for some integer rrr, say that it is odd.
State the conclusion
End with a sentence that matches the original claim. A short phrase such as “Therefore, the square of every odd integer is odd” closes the logical chain.
Proof by deduction worked examples
Prove that the square of an odd integer is odd
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.Factor 222 from the even terms:
(2k+1)2=2(2k2+2k)+1.(2k+1)^2=2(2k^2+2k)+1.(2k+1)2=2(2k2+2k)+1.Since kkk is an integer, 2k2+2k2k^2+2k2k2+2k is also an integer. The expression therefore has the form 2r+12r+12r+1, where r∈Zr\in\mathbb{Z}r∈Z.
Hence, the square of an odd integer is odd.
Prove that the difference between consecutive squares is odd
Let the consecutive integers be kkk and k+1k+1k+1, where k∈Zk\in\mathbb{Z}k∈Z.
The difference between their squares is
(k+1)2−k2.(k+1)^2-k^2.(k+1)2−k2.Expanding and simplifying gives
k2+2k+1−k2=2k+1.k^2+2k+1-k^2=2k+1.k2+2k+1−k2=2k+1.Since k∈Zk\in\mathbb{Z}k∈Z, the result is of the form 2k+12k+12k+1. Therefore, the difference between the squares of consecutive integers is odd.
Prove that the product of consecutive even integers is divisible by 888
Let the consecutive even integers be 2k2k2k and 2k+22k+22k+2, where k∈Zk\in\mathbb{Z}k∈Z.
Their product is
2k(2k+2)=4k(k+1).2k(2k+2)=4k(k+1).2k(2k+2)=4k(k+1).The integers kkk and k+1k+1k+1 are consecutive, so one of them must be even. Therefore, for some integer rrr,
k(k+1)=2r.k(k+1)=2r.k(k+1)=2r.It follows that
4k(k+1)=4(2r)=8r.4k(k+1)=4(2r)=8r.4k(k+1)=4(2r)=8r.The product is a multiple of 888, so the product of consecutive even integers is divisible by 888.
How to approach proof by deduction exam questions
Before writing, underline the condition and the conclusion. Then decide what final algebraic form would prove the result. If you must establish divisibility by 555, aim for 5r5r5r. If you must establish evenness, aim for 2r2r2r.
Try this exam-style prompt:
Prove that the sum of three consecutive integers is divisible by 333.
Let the integers be kkk, k+1k+1k+1 and k+2k+2k+2, where k∈Zk\in\mathbb{Z}k∈Z. Their sum is
k+(k+1)+(k+2)=3k+3=3(k+1).k+(k+1)+(k+2)=3k+3=3(k+1).k+(k+1)+(k+2)=3k+3=3(k+1).Since k+1k+1k+1 is an integer, the sum is a multiple of 333. Therefore, the sum of three consecutive integers is divisible by 333.
After learning the method, practise retrieving it without notes. The Edexcel A-Level Maths Question Bank provides exam-style practice, while the Edexcel Algebraic Methods lesson page helps reinforce the algebra that direct proofs depend on.
Common mistakes in proof by deduction
Using examples as proof
Checking several values provides evidence, not a proof covering every valid integer. Introduce a general integer such as kkk.
Forgetting to define variables
Writing n=2kn=2kn=2k is incomplete unless you make clear that k∈Zk\in\mathbb{Z}k∈Z. The definition depends on kkk being an integer.
Assuming the conclusion
Do not begin by writing the result you are supposed to prove and then rearrange it without showing that each step is reversible. A direct proof should begin from the given information.
Leaving the final form unexplained
Reaching 6k+36k+36k+3 does not finish a proof that an expression is divisible by 333. Write
6k+3=3(2k+1),6k+3=3(2k+1),6k+3=3(2k+1),then explain that 2k+12k+12k+1 is an integer.
Proving the converse instead
The statements “if nnn is divisible by 444, then nnn is even” and “if nnn is even, then nnn is divisible by 444” are converses. The first is true; the second is false. Follow the direction of the implication carefully.
Turn the method into exam practice
Maya's progress comes from replacing disconnected algebra with a repeatable chain: define, deduce, justify and conclude. Knowing that chain is the first step, but writing it fluently under exam conditions requires deliberate practice. Start with the matching Maths Genie Lessons, then use the Question Bank to answer proof by deduction exam questions without notes.



