What you'll learn
- How to use a letter to represent any possible case.
- How to show a result is always odd, even, or divisible by a chosen number.
- How to deal with brackets and squared terms without losing the proof.
- How to finish with a clear conclusion.
1. Start with a general number
In proof, you are not just checking examples. You are showing that something works for every possible case.
Instead of choosing a particular number, choose a letter such as nnn. That letter stands for a general number.
Core language
- An algebraic proof uses letters and algebra to prove a statement is always true.
- An integer is a number with no fractional or decimal part, such as -3, 0, 7 or 12.
- A positive integer is an integer greater than zero.
- Consecutive integers are integers that follow one after another, such as nnn, n+1n+1n+1, n+2n+2n+2.

- An even integer can be written as 2k2k2k for some integer kkk.

- An odd integer can be written as 2k+12k+12k+1 for some integer kkk.
The proof idea
If your final expression has the right algebraic form, you have proved the result for every allowed value, not just for examples you tried.
Two neighbouring integers
Show that adding two integers next to each other always gives an odd answer.

-
Let the smaller integer be nnn. The next integer is n+1n+1n+1.
-
Add them and simplify:
n+(n+1)=2n+1n+(n+1)=2n+1n+(n+1)=2n+1 -
The expression 2n+12n+12n+1 is in the form “even plus 1”, so it is odd.
-
Therefore, the sum of two consecutive integers is always odd.
2. Proving something is a multiple
A common GCSE proof target is to show that an answer is divisible by a number.
Multiple
A multiple of 6 is any number that can be written as 6k6k6k, where kkk is an integer. More generally, a multiple of mmm can be written as mkmkmk.
For example, to prove something is a multiple of 6, your aim is to rearrange it into:
6×an integer6 \times \text{an integer}6×an integerConsecutive even numbers
Consecutive even integers go up by 2, not by 1. A safe way to write three of them is:
2n,2n+2,2n+42n,\quad 2n+2,\quad 2n+42n,2n+2,2n+4Three even integers in a row
Show that the sum of three consecutive even integers is always divisible by 6.

-
Let the three even integers be 2n2n2n, 2n+22n+22n+2 and 2n+42n+42n+4.
-
Add them:
2n+(2n+2)+(2n+4)=6n+62n+(2n+2)+(2n+4)=6n+62n+(2n+2)+(2n+4)=6n+6 -
Factorise by taking out 6:
6n+6=6(n+1)6n+6=6(n+1)6n+6=6(n+1) -
Since n+1n+1n+1 is an integer, 6(n+1)6(n+1)6(n+1) is a multiple of 6.
-
Therefore, the sum is always divisible by 6.
Using , , too loosely
Writing nnn, n+2n+2n+2, n+4n+4n+4 only guarantees numbers spaced by 2. It does not guarantee they are even unless you also say that nnn is even. Starting with 2n2n2n avoids this problem.

3. Expand, simplify, then factorise
Some proof questions give you an expression with brackets and ask you to prove it is always a multiple of something.
Expanding and factorising
- To expand means to remove brackets by multiplying out.
- To factorise means to rewrite an expression using common factors, usually putting brackets back in.
- An expression is a piece of algebra, such as (4n+3)2−(4n−3)2(4n+3)^2-(4n-3)^2(4n+3)2−(4n−3)2.
The usual proof flow is:
- Expand carefully.
- Collect like terms.
- Factorise to reveal the required multiple.
A difference of two squared brackets
Show that (4n+3)2−(4n−3)2(4n+3)^2-(4n-3)^2(4n+3)2−(4n−3)2 is always divisible by 12 for positive integer values of nnn.

-
Expand the first square:
(4n+3)2=16n2+24n+9(4n+3)^2=16n^2+24n+9(4n+3)2=16n2+24n+9 -
Expand the second square:
(4n−3)2=16n2−24n+9(4n-3)^2=16n^2-24n+9(4n−3)2=16n2−24n+9 -
Subtract the second result from the first:
(16n2+24n+9)−(16n2−24n+9)=16n2+24n+9−16n2+24n−9=48n\begin{aligned} (16n^2+24n+9)-(16n^2-24n+9) &=16n^2+24n+9-16n^2+24n-9\\ &=48n \end{aligned}(16n2+24n+9)−(16n2−24n+9)=16n2+24n+9−16n2+24n−9=48n -
Factor out 12:
48n=12(4n)48n=12(4n)48n=12(4n) -
Since 4n4n4n is an integer, the expression is always a multiple of 12.
Shortcut for this shape
When two squared brackets differ only by a sign, use (a+b)2−(a−b)2=4ab(a+b)^2-(a-b)^2=4ab(a+b)2−(a−b)2=4ab as a quick check. Still make sure your working is clear enough for the marks.
4. Showing something is a square number
Sometimes the target is not “multiple of something”, but “square number”.
Square number
A square number is the result of an integer multiplied by itself. Algebraically, it has the form k2k^2k2, where kkk is an integer.
For these proofs, you usually want to end with a single bracket squared, such as (n+5)2(n+5)^2(n+5)2.
Turning a product into a square
Show that (n+5)(n+4)+(n+5)(n+5)(n+4)+(n+5)(n+5)(n+4)+(n+5) is always a square number when nnn is an integer.

-
Notice that both parts contain the factor n+5n+5n+5.
-
Factorise n+5n+5n+5:
(n+5)(n+4)+(n+5)=(n+5)((n+4)+1)(n+5)(n+4)+(n+5)=(n+5)\left((n+4)+1\right)(n+5)(n+4)+(n+5)=(n+5)((n+4)+1) -
Simplify inside the bracket:
(n+5)((n+4)+1)=(n+5)(n+5)(n+5)\left((n+4)+1\right)=(n+5)(n+5)(n+5)((n+4)+1)=(n+5)(n+5) -
Write it as a square:
(n+5)(n+5)=(n+5)2(n+5)(n+5)=(n+5)^2(n+5)(n+5)=(n+5)2 -
Since n+5n+5n+5 is an integer, (n+5)2(n+5)^2(n+5)2 is a square number.
Stopping too early
If the question asks for a square number, do not stop at an expanded form like n2+10n+25n^2+10n+25n2+10n+25. Rewrite it as a square, such as (n+5)2(n+5)^2(n+5)2.
5. Harder proofs: “more than a multiple”
A Grade 8/9-style proof may ask you to show that something is “2 more than a multiple of 8” or “4 more than a multiple of 8”.
That means your target form is:
- 2 more than a multiple of 8: 8k+28k+28k+2
- 4 more than a multiple of 8: 8k+48k+48k+4
Squares of neighbouring odd integers
Show that the sum of the squares of two odd integers next to each other is always 2 more than a multiple of 8.

-
Let the two odd integers be 2n+12n+12n+1 and 2n+32n+32n+3.
-
Square both and add:
(2n+1)2+(2n+3)2=(4n2+4n+1)+(4n2+12n+9)=8n2+16n+10\begin{aligned} (2n+1)^2+(2n+3)^2 &=(4n^2+4n+1)+(4n^2+12n+9)\\ &=8n^2+16n+10 \end{aligned}(2n+1)2+(2n+3)2=(4n2+4n+1)+(4n2+12n+9)=8n2+16n+10 -
Rewrite the expression in the target form:
8n2+16n+10=8(n2+2n+1)+28n^2+16n+10=8(n^2+2n+1)+28n2+16n+10=8(n2+2n+1)+2 -
Since n2+2n+1n^2+2n+1n2+2n+1 is an integer, 8(n2+2n+1)8(n^2+2n+1)8(n2+2n+1) is a multiple of 8.
-
Therefore, the sum is always 2 more than a multiple of 8.
Aim for the target form
Before you start expanding, decide what the final line should look like: odd means 2k+12k+12k+1, a multiple of 6 means 6k6k6k, and 2 more than a multiple of 8 means 8k+28k+28k+2.
In the exam
-
Define your variables clearly, for example: “Let the first integer be nnn.”
-
Use the correct form: even numbers need 2n2n2n, odd numbers need 2n+12n+12n+1, and consecutive numbers must increase correctly.
-
Finish with a sentence linking your final algebraic form to the claim, such as “Since this is 666 times an integer, it is a multiple of 6.”
Check yourself
- Can you write three consecutive odd integers using nnn?
- Can you explain why 12(3n+1)12(3n+1)12(3n+1) is always a multiple of 12?
- Can you prove that the squares of two consecutive integers have an odd sum?
