Proof A Level Maths: Revision Guide and Questions
Revise proof A level maths step by step. Learn deduction, exhaustion, contradiction and counterexamples with worked examples and exam questions.

Proof A Level Maths: Revision Guide and Exam Questions
Proof in A Level Maths is the process of using a complete logical argument to establish that a mathematical statement must be true. You need to understand proof by deduction, proof by exhaustion and proof by contradiction, as well as how a single counterexample can disprove a universal claim.
This guide explains each method step by step, with proof worked examples, common mistakes and exam-style questions. The emphasis is not only on reaching a true result, but on presenting reasoning that proves it in every permitted case.
What is mathematical proof?
A mathematical proof is a sequence of justified statements leading from accepted facts or clearly stated assumptions to a conclusion. Testing several values may provide evidence for a claim, but it does not normally prove that the claim is true.
For example, suppose a statement works when n=1n=1n=1, n=2n=2n=2 and n=3n=3n=3. This does not establish that it works for every integer nnn. A proof must cover the whole set of values named in the question.
A strong proof should:
- define any variables clearly
- use the conditions in the question
- justify each important step
- cover every required case
- finish with a clear conclusion
The principal proof methods named in A Level Maths specifications are summarised below.
| Method | Main idea | When it is useful |
|---|---|---|
| Deduction | Begin with known facts or definitions and derive the required result | Algebraic identities, divisibility, parity and inequalities |
| Exhaustion | Divide a finite set of possibilities into cases and prove each case | Problems with a small, complete number of cases |
| Contradiction | Assume the statement is false and derive an impossibility | Irrationality, infinitely many primes and statements involving impossibility |
| Counterexample | Find one permitted value for which a universal claim fails | Disproving statements containing words such as “all” or “every” |
The AQA A Level Proof revision page provides further lessons and exam-style material. Students following OCR can also use the OCR proof video lessons.
Proof by deduction
Proof by deduction uses definitions, established results and valid algebraic steps to reach a necessary conclusion. It is often called direct proof because you move directly from the assumptions to the required result.
For proofs involving integers, standard algebraic forms are particularly important:
- an even integer can be written as 2k2k2k
- an odd integer can be written as 2k+12k+12k+1
- a multiple of mmm can be written as mkmkmk
Here, k∈Zk\in\mathbb{Z}k∈Z. Stating that kkk is an integer matters because the conclusion about divisibility depends on it.
Worked example: prove that the square of an odd integer is odd
Let nnn be an odd integer. Then, for some k∈Zk\in\mathbb{Z}k∈Z,
n=2k+1. n=2k+1. n=2k+1.Squaring gives
n2=(2k+1)2=4k2+4k+1. n^2=(2k+1)^2=4k^2+4k+1. n2=(2k+1)2=4k2+4k+1.Factor the even part:
n2=2(2k2+2k)+1. n^2=2(2k^2+2k)+1. n2=2(2k2+2k)+1.Since kkk is an integer, 2k2+2k2k^2+2k2k2+2k is also an integer. Therefore n2n^2n2 has the form 2m+12m+12m+1 for an integer mmm, so n2n^2n2 is odd.
The final sentence is essential. The algebra alone produces the correct form, but a proof must explain why that form establishes the result.
Worked example: prove a divisibility result
Prove that the difference between the squares of two consecutive integers is odd.
Let the consecutive integers be nnn and n+1n+1n+1, where n∈Zn\in\mathbb{Z}n∈Z. Their difference of squares is
(n+1)2−n2=n2+2n+1−n2=2n+1. (n+1)^2-n^2=n^2+2n+1-n^2=2n+1. (n+1)2−n2=n2+2n+1−n2=2n+1.Since nnn is an integer, 2n+12n+12n+1 is odd. Therefore, the difference between the squares of any two consecutive integers is odd.
Notice that the integers were represented generally. Checking 42−32=74^2-3^2=742−32=7 would illustrate the result, but it would not prove it for every pair of consecutive integers.
Proof by exhaustion
Proof by exhaustion establishes a result by considering every possible case. It is valid only when the list of cases is complete.
This method is not the same as trying a few examples. You must explain why no other cases are possible, then verify the statement in each case.
Worked example: prove a property of remainders
Prove that the square of any integer leaves remainder 000 or 111 when divided by 444.
Every integer is either even or odd, so these two cases exhaust all possibilities.
Case 1: nnn is even. Write n=2kn=2kn=2k, where k∈Zk\in\mathbb{Z}k∈Z. Then
n2=4k2, n^2=4k^2, n2=4k2,which is divisible by 444 and therefore leaves remainder 000.
Case 2: nnn is odd. Write n=2k+1n=2k+1n=2k+1, where k∈Zk\in\mathbb{Z}k∈Z. Then
n2=(2k+1)2=4k2+4k+1=4(k2+k)+1, n^2=(2k+1)^2=4k^2+4k+1=4(k^2+k)+1, n2=(2k+1)2=4k2+4k+1=4(k2+k)+1,which leaves remainder 111 when divided by 444.
Every integer is even or odd, and both cases have been established. Therefore the square of an integer leaves remainder 000 or 111 when divided by 444.
Proof by exhaustion may also use residue classes. For example, every integer has one of the forms 3k3k3k, 3k+13k+13k+1 or 3k+23k+23k+2. These cases are exhaustive because they represent all possible remainders after division by 333.
Disproof by counterexample
A statement such as “for every real number xxx” is a universal statement. To disprove it, you need only one permitted value for which its conclusion is false. That value is a counterexample.
Worked example: disprove a claim
Consider the statement:
For every real number xxx, x2>xx^2>xx2>x.
Choose x=12x=\frac12x=21. Then
x2=14, x^2=\frac14, x2=41,and
14≯12. \frac14\not>\frac12. 41>21.Therefore x=12x=\frac12x=21 is a counterexample, so the statement is false.
A counterexample must satisfy all the original conditions. If a claim applies only to positive integers, a negative number cannot disprove it. You should also explicitly compare the counterexample with the claimed conclusion rather than merely writing down a value.
Counterexamples disprove universal claims, but examples do not prove them. This difference is one of the most frequently tested logical ideas in proof exam questions.
Proof by contradiction
In proof by contradiction, you assume that the required statement is false. You then use valid reasoning until this assumption produces an impossibility, contradicts a known fact or contradicts one of the original conditions.
The usual structure is:
- Assume the negation of the statement to be proved.
- Develop the consequences of that assumption.
- Reach a contradiction.
- Conclude that the assumption was false, so the original statement is true.
Worked example: prove that 2\sqrt{2}2 is irrational
Assume, for contradiction, that 2\sqrt{2}2 is rational. It can therefore be written in its simplest form as
2=ab, \sqrt{2}=\frac{a}{b}, 2=ba,where a,b∈Za,b\in\mathbb{Z}a,b∈Z, b≠0b\ne0b=0, and aaa and bbb have no common factor.
Squaring gives
2=a2b2, 2=\frac{a^2}{b^2}, 2=b2a2,so
a2=2b2. a^2=2b^2. a2=2b2.Therefore a2a^2a2 is even. Since the square of an odd integer is odd, aaa must be even. Write a=2ka=2ka=2k for some k∈Zk\in\mathbb{Z}k∈Z.
Substituting gives
(2k)2=2b2, (2k)^2=2b^2, (2k)2=2b2,so
4k2=2b2 4k^2=2b^2 4k2=2b2and hence
b2=2k2. b^2=2k^2. b2=2k2.Therefore b2b^2b2 is even, so bbb is even. Both aaa and bbb are even, which means that they have a common factor of 222.
This contradicts the assumption that ab\frac{a}{b}ba was written in its simplest form. Therefore the original assumption is false, and 2\sqrt{2}2 is irrational.
The contradiction is not simply that aaa and bbb are even. It is that they are even despite having been chosen with no common factor. A precise proof identifies the two incompatible statements.
For targeted practice, use the Edexcel proof by contradiction question bank or the OCR proof by contradiction questions.
How to choose the correct proof method
Some questions name the required method. If they do, you must use it. When the method is not specified, the wording and structure of the claim provide useful clues.
| Feature of the question | Likely approach |
|---|---|
| Parity, divisibility or an algebraic identity | Deduction using a general integer form |
| A small finite set of possible values or remainders | Exhaustion |
| “Show that this cannot happen” or an irrationality result | Contradiction |
| “Disprove” followed by a claim about all values | Counterexample |
These are guides rather than rigid rules. Some statements can be proved in more than one way, but the shortest valid argument is usually the safest choice under exam conditions.
Embedded exam-style proof question
Question: Prove by deduction that the product of two consecutive even integers is divisible by 888. [4 marks]
Answer
Let the consecutive even integers be 2n2n2n and 2n+22n+22n+2, where n∈Zn\in\mathbb{Z}n∈Z.
Their product is
2n(2n+2)=4n(n+1). 2n(2n+2)=4n(n+1). 2n(2n+2)=4n(n+1).The integers nnn and n+1n+1n+1 are consecutive, so one of them must be even. Therefore n(n+1)n(n+1)n(n+1) is even and can be written as 2k2k2k for some k∈Zk\in\mathbb{Z}k∈Z.
Hence
4n(n+1)=4(2k)=8k. 4n(n+1)=4(2k)=8k. 4n(n+1)=4(2k)=8k.The product is therefore divisible by 888.
Try 4 more: practise complete arguments and compare your reasoning with worked solutions and mark schemes using the AQA structure and methods of proof questions.
Further proof exam questions with answers
Question 1: deduction
Prove that the sum of three consecutive integers is divisible by 333.
Answer: Let the integers be nnn, n+1n+1n+1 and n+2n+2n+2, where n∈Zn\in\mathbb{Z}n∈Z. Their sum is
n+(n+1)+(n+2)=3n+3=3(n+1). n+(n+1)+(n+2)=3n+3=3(n+1). n+(n+1)+(n+2)=3n+3=3(n+1).Since n+1n+1n+1 is an integer, the sum is a multiple of 333.
Question 2: counterexample
Disprove the statement: “The sum of two irrational numbers is always irrational.”
Answer: Take 2\sqrt{2}2 and −2-\sqrt{2}−2. Both numbers are irrational, but
2+(−2)=0, \sqrt{2}+(-\sqrt{2})=0, 2+(−2)=0,which is rational. Therefore the statement is false.
Question 3: exhaustion
Prove that n2+nn^2+nn2+n is even for every integer nnn by considering all possible parity cases.
Answer: If n=2kn=2kn=2k, then
n2+n=4k2+2k=2(2k2+k), n^2+n=4k^2+2k=2(2k^2+k), n2+n=4k2+2k=2(2k2+k),so the expression is even. If n=2k+1n=2k+1n=2k+1, then
n2+n=(2k+1)2+(2k+1)=4k2+6k+2=2(2k2+3k+1), n^2+n=(2k+1)^2+(2k+1)=4k^2+6k+2=2(2k^2+3k+1), n2+n=(2k+1)2+(2k+1)=4k2+6k+2=2(2k2+3k+1),so it is also even. Every integer is even or odd, so the expression is even for every integer nnn.
Common mistakes in proof exam questions
Using examples instead of general reasoning
Several successful numerical checks are still only evidence. Unless the question has a finite list of cases and you check every one, use a general variable.
Failing to define the variable
Writing n=2k+1n=2k+1n=2k+1 is incomplete unless it is clear that kkk is an integer. Definitions establish the conditions that make later divisibility arguments valid.
Starting with the result to be proved
If you begin with the required conclusion and rearrange it, you may accidentally assume what you are meant to establish. Work from known assumptions towards the conclusion, or make it clear that every step is reversible.
Missing cases in proof by exhaustion
Checking even numbers but not odd numbers cannot prove a result about all integers. State why your cases cover every possibility.
Negating a statement incorrectly
The negation of “xxx is rational” is “xxx is irrational”. More generally, the negation of “every value has a property” is “at least one value does not have the property”, not “no values have the property”.
Omitting the final conclusion
An examiner should not have to infer why your last equation proves the claim. End with a sentence linking the final mathematical form to the required result.
How to revise proof effectively
Begin by learning the standard definitions for even, odd, divisible and rational numbers. Then practise identifying which proof method fits a statement before attempting its algebra.
When checking a solution, focus on logical gaps as well as calculations. Ask whether each variable has been defined, whether every case has been covered and whether the conclusion follows for all allowed values.
A useful revision sequence is:
- Review a lesson on one proof method.
- Reproduce a model proof without looking at it.
- Answer several proof exam questions.
- Compare each line with the worked solution and mark scheme.
- Rewrite any incomplete proof in a concise, rigorous form.
Students revisiting earlier course content can consult the GCSE Maths topics by exam board and tier. At A Level, however, your proofs must use the more formal definitions and methods required by your current specification.
Conclusion
Proof at A Level requires a logically complete argument, not just a correct pattern or several successful examples. Deduction develops a result from definitions, exhaustion covers every possible case, contradiction rejects a false assumption, and a counterexample disproves a universal statement.
Define variables carefully, justify important transitions and finish by stating exactly why the result follows. MathsGenie lessons can help you review the methods, while its practice questions, worked solutions and mark schemes let you test whether your written arguments meet exam standards.
Sources and referenced URLs
- https://mathsgenie.co.uk/a-level/maths/aqa/a-proof
- https://mathsgenie.co.uk/a-level/maths/aqa/structure-and-methods-of-proof/questions/q1
- https://mathsgenie.co.uk/a-level/maths/edexcel/a-level-pure-mathematics-1-1-proof-by-contradiction/questions/q1
- https://mathsgenie.co.uk/a-level/maths/ocr/proof/videos
- https://mathsgenie.co.uk/a-level/maths/ocr/proof-by-contradiction/questions/q1
- https://mathsgenie.co.uk/blog/gcse-maths-topics-by-exam-board-and-tier


