Hardest GCSE Maths Algebraic Proof Questions
Learn how to solve the hardest GCSE Maths algebraic proof questions with Higher tier methods, worked examples, common mistakes and exam practice answers.

The hardest GCSE Maths algebraic proof questions require more than accurate expansion. You must translate a general statement into algebra, manipulate it logically and finish by showing that the result has the required form.
At Higher tier, algebra can be used to construct proofs involving odd and even numbers, consecutive integers, multiples, squares and identities. The questions become difficult when the correct representation is not given or when several stages of manipulation are needed. This guide explains those stages through Higher tier worked examples, exam-style questions and common errors.
What makes an algebraic proof valid?
A proof must establish that a statement is true in every permitted case. Testing a few numbers can suggest that a statement is true, but it does not prove it.
For example, checking that 323^232, 525^252 and 727^272 are odd does not prove that the square of every odd integer is odd. A valid proof begins with a general odd integer, such as 2n+12n+12n+1, where nnn is an integer.
The standard structure is:
- Represent the unknown integers algebraically.
- Manipulate the resulting expression correctly.
- Rewrite the answer in a recognised form.
- Conclude by connecting that form to the statement being proved.
That final conclusion matters. An expression such as 8n+88n+88n+8 should be written as 8(n+1)8(n+1)8(n+1) so that it is visibly a multiple of 888.
Essential algebraic forms for proof
The hardest questions become more manageable when you know how to represent each type of number.
| Description | Algebraic representation |
|---|---|
| Any integer | nnn |
| An even integer | 2n2n2n |
| An odd integer | 2n+12n+12n+1 |
| A multiple of kkk | knknkn |
| Two consecutive integers | nnn and n+1n+1n+1 |
| Three consecutive integers | nnn, n+1n+1n+1 and n+2n+2n+2 |
| Consecutive odd integers | 2n+12n+12n+1 and 2n+32n+32n+3 |
| Consecutive even integers | 2n2n2n and 2n+22n+22n+2 |
In every row, nnn is an integer. This condition should be stated because expressions such as 2n+12n+12n+1 represent odd integers only when nnn is an integer.
A useful proof does not merely reach a simplified expression. It reaches a form such as 2k2k2k, 2k+12k+12k+1 or 5k5k5k, where kkk can be shown to be an integer.
Worked example 1: proving a result about odd squares
Prove that the square of any odd integer is one more than a multiple of 888.
Step 1: represent an arbitrary odd integer
Let the odd integer be 2n+12n+12n+1, where nnn is an integer.
Step 2: square and expand it
(2n+1)2=4n2+4n+1 (2n+1)^2=4n^2+4n+1 (2n+1)2=4n2+4n+1Factorise the first two terms:
4n2+4n+1=4n(n+1)+1 4n^2+4n+1=4n(n+1)+1 4n2+4n+1=4n(n+1)+1Step 3: use a property of consecutive integers
The integers nnn and n+1n+1n+1 are consecutive, so one of them must be even. Their product is therefore even.
This means that n(n+1)=2kn(n+1)=2kn(n+1)=2k for some integer kkk.
Step 4: substitute and conclude
4n(n+1)+1=4(2k)+1=8k+1 4n(n+1)+1=4(2k)+1=8k+1 4n(n+1)+1=4(2k)+1=8k+1Since kkk is an integer, 8k8k8k is a multiple of 888. Therefore, the square of any odd integer is one more than a multiple of 888.
The important step is recognising that n(n+1)n(n+1)n(n+1) is even. Stopping at 4n(n+1)+14n(n+1)+14n(n+1)+1 would not fully establish the required multiple of 888.
Worked example 2: consecutive odd squares
Prove that the difference between the squares of two consecutive odd integers is a multiple of 888.
Step 1: represent consecutive odd integers
Let the integers be 2n+12n+12n+1 and 2n+32n+32n+3, where nnn is an integer.
Using 2n+12n+12n+1 and 2n+22n+22n+2 would be incorrect because the second expression is even.
Step 2: form the difference of the squares
(2n+3)2−(2n+1)2 (2n+3)^2-(2n+1)^2 (2n+3)2−(2n+1)2Expand both brackets:
4n2+12n+9−(4n2+4n+1) 4n^2+12n+9-(4n^2+4n+1) 4n2+12n+9−(4n2+4n+1)Take care when removing the second bracket. Every term inside it is being subtracted.
Step 3: simplify and factorise
4n2+12n+9−4n2−4n−1=8n+8 4n^2+12n+9-4n^2-4n-1=8n+8 4n2+12n+9−4n2−4n−1=8n+8 8n+8=8(n+1) 8n+8=8(n+1) 8n+8=8(n+1)Since n+1n+1n+1 is an integer, 8(n+1)8(n+1)8(n+1) is a multiple of 888. Therefore, the difference between the squares of two consecutive odd integers is always divisible by 888.
An alternative method uses the difference of two squares:
a2−b2=(a−b)(a+b) a^2-b^2=(a-b)(a+b) a2−b2=(a−b)(a+b)This gives
(2)(4n+4)=8(n+1). (2)(4n+4)=8(n+1). (2)(4n+4)=8(n+1).Both methods are valid. The factorisation method is shorter, but direct expansion may be safer if you do not immediately recognise the identity.
Worked example 3: four consecutive integers
Prove that the product of four consecutive positive integers, increased by 111, is a square number.
Let the integers be nnn, n+1n+1n+1, n+2n+2n+2 and n+3n+3n+3, where nnn is a positive integer.
The expression to consider is
n(n+1)(n+2)(n+3)+1. n(n+1)(n+2)(n+3)+1. n(n+1)(n+2)(n+3)+1.Expanding all four brackets immediately would create a complicated quartic expression. Instead, pair the first and last factors, then pair the middle factors:
n(n+3)=n2+3n n(n+3)=n^2+3n n(n+3)=n2+3nand
(n+1)(n+2)=n2+3n+2. (n+1)(n+2)=n^2+3n+2. (n+1)(n+2)=n2+3n+2.Let x=n2+3nx=n^2+3nx=n2+3n. The expression becomes
x(x+2)+1. x(x+2)+1. x(x+2)+1.Now simplify:
x2+2x+1=(x+1)2. x^2+2x+1=(x+1)^2. x2+2x+1=(x+1)2.Substituting back gives
n(n+1)(n+2)(n+3)+1=(n2+3n+1)2. n(n+1)(n+2)(n+3)+1=(n^2+3n+1)^2. n(n+1)(n+2)(n+3)+1=(n2+3n+1)2.The right-hand side is the square of an integer, so the original expression is always a square number.
This is a demanding proof because the useful grouping is hidden. It illustrates an important Higher tier strategy: before expanding a large expression, look for pairs that produce similar algebraic forms.
How to approach unfamiliar proof questions
Start by identifying the exact conclusion. If the question asks you to prove that something is even, your target is 2k2k2k. For a multiple of 777, the target is 7k7k7k. For an odd number, aim for 2k+12k+12k+1.
Then work backwards mentally. Ask what must be factorised, paired or established for the final expression to reach that target.
Useful checks include:
- Have all stated numbers been represented correctly?
- Is every letter declared to be an integer?
- Have brackets been expanded with the correct signs?
- Can the final expression be factorised to reveal the required multiple?
- Does the conclusion explain why the algebra proves the statement?
If expanding or factorising is causing errors, revise these skills with the MathsGenie expanding and factorising lesson and expanding and factorising quadratics guide.
Choose representations that preserve the conditions
When a question involves two unrelated odd integers, use different integer variables. Using the same expression for both would accidentally assume that the numbers are equal. By contrast, consecutive numbers need a shared variable because their relationship must remain visible throughout the proof.
Read restrictions carefully before starting. A statement about positive integers allows a narrower set of values than a statement about all integers. Your opening definition should cover every permitted value, and your reasoning must remain valid across that whole set.
Use the target to guide your algebra
A simplified expression is not always the most useful expression. Factorised form reveals divisibility, while a squared bracket reveals a square number. Choose the form that makes the requested property visible instead of expanding automatically.
If your expression seems close to the target, inspect the remaining factor before changing methods. It may contain consecutive integers or another expression whose parity you can establish. Explain that extra fact explicitly so the reader can follow the reasoning. This is often the missing link between correct manipulation and a complete proof, particularly when an additional factor is needed to establish divisibility.
Common mistakes in Higher tier algebraic proof
Checking examples instead of proving the result
Numerical examples provide evidence, not a general proof. Unless the question asks for a counterexample, use algebra involving an arbitrary integer.
Using the wrong consecutive-number model
Consecutive integers differ by 111, but consecutive odd or even integers differ by 222. For example, 2n+12n+12n+1 and 2n+22n+22n+2 are not both odd.
Assuming that different letters are consecutive
Writing nnn and mmm gives two unspecified integers. It does not indicate any relationship between them. Use nnn and n+1n+1n+1 for consecutive integers.
Ending without showing the required form
If you obtain 6n+126n+126n+12, factorise it as 6(n+2)6(n+2)6(n+2). This makes it clear that the expression is a multiple of 666 because n+2n+2n+2 is an integer.
Treating a demonstration as an equation to solve
A proof question usually asks you to establish a general result, not find a particular value of nnn. Do not divide through and try to solve unless the question specifically requires it.
Losing a negative sign
When subtracting one expression from another, use brackets:
A−(B+C)=A−B−C. A-(B+C)=A-B-C. A−(B+C)=A−B−C.A sign error can invalidate the whole argument even when the chosen method is correct.
Exam-style algebraic proof questions with answers
Question 1
Prove that the sum of five consecutive integers is a multiple of 555.
Answer: Let the integers be nnn, n+1n+1n+1, n+2n+2n+2, n+3n+3n+3 and n+4n+4n+4, where nnn is an integer.
n+(n+1)+(n+2)+(n+3)+(n+4)=5n+10=5(n+2). n+(n+1)+(n+2)+(n+3)+(n+4)=5n+10=5(n+2). n+(n+1)+(n+2)+(n+3)+(n+4)=5n+10=5(n+2).Since n+2n+2n+2 is an integer, the sum is a multiple of 555.
Question 2
Prove that the sum of the squares of two consecutive integers is odd.
Answer: Let the integers be nnn and n+1n+1n+1, where nnn is an integer.
n2+(n+1)2=2n2+2n+1=2(n2+n)+1. n^2+(n+1)^2=2n^2+2n+1=2(n^2+n)+1. n2+(n+1)2=2n2+2n+1=2(n2+n)+1.Since n2+nn^2+nn2+n is an integer, the expression has the form 2k+12k+12k+1. It is therefore odd.
Question 3
The claim states that n2+n+41n^2+n+41n2+n+41 is prime for every positive integer nnn. Disprove the claim.
Answer: A universal claim can be disproved with one counterexample. Choose n=40n=40n=40:
402+40+41=1681=412. 40^2+40+41=1681=41^2. 402+40+41=1681=412.This is not prime, so the claim is false.
Embedded exam-style challenge
Prove that the sum of the squares of three consecutive integers leaves a remainder of 222 when divided by 333.
Let the integers be nnn, n+1n+1n+1 and n+2n+2n+2, where nnn is an integer.
n2+(n+1)2+(n+2)2 n^2+(n+1)^2+(n+2)^2 n2+(n+1)2+(n+2)2 =n2+n2+2n+1+n2+4n+4 =n^2+n^2+2n+1+n^2+4n+4 =n2+n2+2n+1+n2+4n+4 =3n2+6n+5 =3n^2+6n+5 =3n2+6n+5Rewrite the expression in the required form:
3n2+6n+5=3(n2+2n+1)+2. 3n^2+6n+5=3(n^2+2n+1)+2. 3n2+6n+5=3(n2+2n+1)+2.Since n2+2n+1n^2+2n+1n2+2n+1 is an integer, the expression has the form 3k+23k+23k+2. It therefore leaves a remainder of 222 when divided by 333.
Try 444 more algebraic proof questions, using the worked solutions and mark schemes to check that every conclusion is justified.
Improving your proof answers for the exam
Write one logical statement per line. This makes your argument easier to follow and helps you notice missing stages. A correct conclusion cannot repair unclear or incorrect algebra earlier in the proof.
When checking a solution, compare more than the final expression. Look for where the variables were defined, how the key factorisation was found and whether the final statement refers back to the original claim.
MathsGenie’s GCSE proof lesson and practice resources provide further exam-style questions, while the proof revision guide is useful for reviewing the underlying notation and methods. You can also use the GCSE Maths topics by exam board and tier guide to place proof within your wider Higher tier revision.
Conclusion
The hardest GCSE Maths algebraic proof questions test representation, manipulation and logical communication together. Begin with a general integer, work towards a recognised form and finish by stating exactly why that form proves the result.
Practise identifying odd, even and consecutive integers until the representations are automatic. Then use MathsGenie’s proof lessons, practice questions and mark schemes to refine the structure of your answers as well as the algebra.
Sources and referenced URLs
- https://mathsgenie.co.uk/gcse/maths/edexcel/grade-8-9-8-3-proof
- https://mathsgenie.co.uk/gcse/maths/edexcel/grade-8-9-8-3-proof/revision-guides
- https://mathsgenie.co.uk/gcse/maths/edexcel/grade-8-9-8-3-proof/questions/q35~9e3a0b8f-ff17-4919-a561-ecc8e6afeb74
- https://mathsgenie.co.uk/gcse/maths/edexcel/grade-4-4-8-expanding-and-factorising
- https://mathsgenie.co.uk/gcse/maths/edexcel/grade-5-5-7-expanding-and-factorising-quadratics/revision-guides
- https://mathsgenie.co.uk/blog/gcse-maths-topics-by-exam-board-and-tier



