J560 · 6.01–6.02Algebraic ExpressionsHigherGrades 6–9

Algebraic Proof

Checking that $3^{2} - 1$ , $5^{2} - 1$ and $7^{2} - 1$ are all multiples of 8 is convincing — but it is not a proof, because there are infinitely many odd numbers you have not checked. An $\textbf{algebraic proof}$ uses a letter to represent any odd number at once, so one argument settles every case.

45 min Algebraic Expressions

The big picture

The key move is choosing the right representation: $2n$ for any even number, $2n + 1$ for any odd number, $n, n + 1, n + 2$ for consecutive integers. Once the statement is written in algebra, expanding and factorising reveal why it is true.

OCR proof questions are usually 3 or 4 marks, and the final mark goes to a clear concluding statement that links the algebra back to the claim. Showing examples, however many, earns nothing for "prove".

GCSE Maths - How to Prove Algebraic Identities - Proof Part 2 (2026/27 exams)Curated by Kepler, not produced by us. Watch it, then read the notes below.

Open on YouTube

Before you start

Try a short calculation from the preceding topic without the notes.
Check the tier and grade band shown in this lesson.

Watch, pause, try

Video by Cognito. The video’s own board label is retained; follow the specification reference and scope notes on this lesson for assessed content.

Viewing focus: Represent even, odd, consecutive and multiple numbers algebraically

After watching, attempt these questions before opening the answers. You can also use the written lesson below.

After watching 1: Which expression represents any odd number?

Show answer and reasoning

$2n + 1$ . One more than an even number.

After watching 2: The sum of two consecutive integers $n + (n + 1)$ simplifies to:

Show answer and reasoning

$2n + 1$ . So it is always odd.

What you'll learn

Represent even, odd, consecutive and multiple numbers algebraically
Prove statements about integers using algebra
Prove that an identity holds by showing both sides are equal
Disprove a statement with a counterexample

Representing numbers

If $n$ is any integer: $2n$ is any even number; $2n + 1$ (or $2n - 1$ ) is any odd number; $n$ , $n + 1$ , $n + 2$ are consecutive integers.

Consecutive even numbers: $2n$ , $2n + 2$ . Consecutive odd numbers: $2n + 1$ , $2n + 3$ .

A multiple of 5 can be written $5n$ ; a number one more than a multiple of 3 is $3n + 1$ .

To show an expression is a multiple of $k$ , rewrite it as $k \times (\text{an integer})$ . To show it is odd, write it as $2 \times (\text{an integer}) + 1$ .

Your turnSame method, new numbers — try it before moving on.

The first of two consecutive even numbers is $2n$ . Write a simplified expression for their sum.

Your answer

Tip — Use different letters for numbers that are not related. Two unrelated odd numbers are $2m + 1$ and $2n + 1$ , not both $2n + 1$ — otherwise you have assumed they are equal.

Proofs about integers

Write the numbers in the claim algebraically, carry out the operation (add, multiply, square), then factorise to expose the required factor or form.

End with a sentence: " $2(n + 1)$ is 2 multiplied by an integer, so the sum is even."

Example 1Prove that the sum of three consecutive integers is always a multiple of 3.

1Let the integers be

n

n + 1

and

n + 2

2Sum:

3n + 3

3Factorise:

3(n + 1)

Answer

3(n + 1)

is 3 times an integer, so the sum is always a multiple of 3.

Example 2Prove that the square of any odd number is one more than a multiple of 8.

1Let the odd number be

2n + 1

. Its square is

4n^{2} + 4n + 1 = 4n(n + 1) + 1

n

and

n + 1

are consecutive, so one of them is even; hence

n(n + 1) = 2k

for some integer

k

3So the square is

4(2k) + 1 = 8k + 1

AnswerThe square of an odd number is

8k + 1

: one more than a multiple of 8.

Why this works

The second proof needed one extra fact — that a product of consecutive integers is even. Proofs often hinge on a small observation like this, which is why reasoning in words alongside the algebra matters.

Proving identities

To prove an identity, start from one side (usually the more complicated) and manipulate it until it matches the other. Do not move terms between sides as if solving an equation.

Alternatively, simplify both sides separately to the same expression.

Example 1Prove that

(n + 3)^{2} - (n - 3)^{2} \equiv 12n

1Expand:

(n^{2} + 6n + 9) - (n^{2} - 6n + 9)

2Remove brackets:

n^{2} + 6n + 9 - n^{2} + 6n - 9

3Simplify:

12n

AnswerLeft side

= 12n =

right side, so the identity holds.

Counterexamples

To show a statement is $\textbf{false}$ , one example where it fails is enough — a $\textbf{counterexample}$ .

Test small numbers, zero, negatives and fractions, which are where general claims most often break.

Example 1Show that the statement "

n^{2} + n + 11

is prime for every positive integer

n

" is false.

1Try

n = 10

100 + 10 + 11 = 121

121 = 11 \times 11

, which is not prime.

Answer

n = 10

is a counterexample.

Your turnSame method, new numbers — try it before moving on.

What is the smallest positive integer $n$ for which $n^2 - n + 11$ is not prime?

Your answer

Tip — A counterexample needs the working that shows it fails — state the value, the result, and why the result breaks the claim.

Think like an examiner

Define what $n$ represents at the start.
Show the factorised form that proves the result.
Finish with a concluding sentence referring back to the statement.

Representations

2n,\ 2n + 1

Even and odd.

n,\ n + 1,\ n + 2

Consecutive integers.

k \times (\text{integer})

Showing a multiple of k.

Watch out for these

Proving by testing several numbers.

Examples illustrate but do not prove; use algebra for the general case.

Using

2n + 1

for two different odd numbers.

Use different letters:

2m + 1

and

2n + 1

Stopping at

6n + 12

without a conclusion.

Write

6(n + 2)

and state that it is a multiple of 6.

Treating an identity like an equation and "solving" it.

Transform one side into the other.

Stretch yourself

Prove that the difference between the squares of two consecutive odd numbers is always a multiple of 8.

Hint — Let the numbers be $2n + 1$ and $2n + 3$ . Subtract their squares, or use the difference of two squares.

Questions students ask

Why isn’t checking lots of numbers enough?

There are infinitely many integers. A pattern holding for a thousand cases can still fail for the next — only a general argument covers them all.

Do I need a concluding sentence?

Yes. The final mark is often for explicitly linking the algebra to the claim.

What does

\equiv

mean?

It means "is identical to" — true for every value of the variable, not just particular solutions.

Key takeaways

Represent evens as $2n$ , odds as $2n + 1$ , consecutive integers as $n, n + 1, \dots$
Manipulate algebraically, then factorise to reveal the required form.
Conclude in words, referring to the statement.
Prove identities by transforming one side into the other.
One counterexample disproves a general statement.

Exam-style questions

Practise it the way it is examined

3 original questions · 9 marks, written to match the style and mark allocation of the real papers. Work on paper, then open the mark scheme and tick the marks you earned — method marks count even if the final answer slips.

Question 1Grade 63 marks

Prove that the product of two odd numbers is always odd.[3]

Question 2Grade 83 marks

Prove that $(2n + 3)^2 - (2n - 1)^2$ is always a multiple of 8, for any integer $n$ .[3]

Question 3Grade 73 marks

Prove that the sum of any three consecutive even numbers is a multiple of 6.[3]

Explore further

OCR J560 official specification (opens in a new tab)
Check the assessed scope and practical or mathematical requirements.
Read or explore this topic (opens in a new tab)
An external explanation or interactive activity to use alongside the lesson. It may include extension material.

Return to this tomorrow

Close the notes and answer from memory. Revisit any explanation you cannot yet reconstruct.

Which shows that $4n + 6$ is always even?
Which is a counterexample to "all prime numbers are odd"?
$(n + 1)^{2} - n^{2}$ simplifies to:
The product of two odd numbers $(2m + 1)(2n + 1)$ can be written as:

Test yourself

Answer a few questions, then review anything you missed.

Next step

Keep practising

Start with the quiz above to check the key ideas. You can also choose another topic from the practice library.

Browse practice topics

Related lessons

All 6 lessons

Algebraic Proof

Checking that

3^{2} - 1

5^{2} - 1

and

7^{2} - 1

are all multiples of 8 is convincing — but it is not a proof, because there are infinitely many odd numbers you have not checked. An

\textbf{algebraic proof}

uses a letter to represent any odd number at once, so one argument settles every case.

45 min Algebraic Expressions

Watch, pause, try

Video by Cognito. The video’s own board label is retained; follow the specification reference and scope notes on this lesson for assessed content.

Viewing focus: Represent even, odd, consecutive and multiple numbers algebraically

After watching, attempt these questions before opening the answers. You can also use the written lesson below.

After watching 1: Which expression represents any odd number?

Show answer and reasoning

$2n + 1$ . One more than an even number.

After watching 2: The sum of two consecutive integers $n + (n + 1)$ simplifies to:

Show answer and reasoning

$2n + 1$ . So it is always odd.

Practise it the way it is examined

Question 1Grade 63 marks

Prove that the product of two odd numbers is always odd.[3]

Question 2Grade 83 marks

Prove that $(2n + 3)^2 - (2n - 1)^2$ is always a multiple of 8, for any integer $n$ .[3]

Question 3Grade 73 marks

Prove that the sum of any three consecutive even numbers is a multiple of 6.[3]

Return to this tomorrow

Close the notes and answer from memory. Revisit any explanation you cannot yet reconstruct.

Which shows that

4n + 6

is always even?

Which is a counterexample to "all prime numbers are odd"?

(n + 1)^{2} - n^{2}

simplifies to:

The product of two odd numbers

(2m + 1)(2n + 1)

can be written as: