POPStudying

Pearson Edexcel 4MA1 IGCSE  ·  Topic G8.3  ·  Higher tier

G8.3 Algebraic Proof

Image  ·  914 × 270

01 — Explanation

What's the difference between "prove", "show that", and "disprove"?

  • "Prove algebraically": build a fully general argument using algebra — numerical examples score zero, no matter how many you test.
  • "Show that": you're given the target expression (often from a geometric context) and must derive it step by step from a stated principle (e.g. Pythagoras, an area formula).
  • "Disprove" / "show [x] is wrong": find just one counter-example. No algebra required — strategic number-testing is the actual skill.

02 — Explanation

How do I translate English into algebra correctly?

StatementAlgebra
Any integernn
Even number2n2n
Odd number2n+12n+1
Consecutive integersn, n+1, n+2n,\ n+1,\ n+2
Consecutive even numbers2n, 2n+2, 2n+42n,\ 2n+2,\ 2n+4
Consecutive odd numbers2n+1, 2n+32n+1,\ 2n+3 (or the "elegant" pair 2n−1, 2n+12n-1,\ 2n+1)
Multiple of kkknkn

Common Mistake

Writing consecutive even numbers as n,n+2,n+4n,n+2,n+4 — this doesn't guarantee nn itself is even. Always build from 2n2n.

03 — Explanation

How do I structure a direct proof?

Three non-negotiable steps:

  1. Premise — define your variables using the dictionary above.
  2. Manipulation — expand, simplify, collect like terms.
  3. Conclusion — factorise into the exact form the question claims (e.g. 2k2k for "even", 8k8k for "multiple of 8"), then write a sentence explicitly linking this back to the original claim. Stopping at the factorised algebra loses the final mark — you must state the conclusion in words.

Worked example: Prove the sum of two consecutive odd integers is always even.

Let the integers be 2n+12n+1 and 2n+32n+3. Their sum is (2n+1)+(2n+3)=4n+4=2(2n+2)(2n+1)+(2n+3) = 4n+4 = 2(2n+2).

Since nn is an integer, 2n+22n+2 is also an integer, so 2(2n+2)2(2n+2) is 2×integer2\times\text{integer} — the definition of an even number. Therefore the sum is always even.

04 — Explanation

When should I use the difference of two squares?

Many "prove a multiple of..." questions become much faster if you spot a2−b2=(a+b)(a−b)a^2-b^2=(a+b)(a-b) instead of brute-force expanding.

Worked example: Prove (3n+1)2−(3n−1)2(3n+1)^2-(3n-1)^2 is always a multiple of 12.

Let a=3n+1, b=3n−1a=3n+1,\ b=3n-1. Then a+b=6na+b=6n and a−b=2a-b=2, so:

(a+b)(a−b)=(6n)(2)=12n(a+b)(a-b) = (6n)(2) = 12n

This is 12×12\times an integer, so the expression is always a multiple of 12 — found far faster than expanding both brackets separately.

05 — Explanation

What's the strategy for "disprove" questions?

Test boundaries (n=0,1n=0,1) and special cases (the only even prime, 22; negative numbers) rather than random "easy" numbers.

Worked example: Ali thinks n2+n+1n^2+n+1 is always prime. Testing n=1,2,3n=1,2,3 gives 3,7,133,7,13 — all prime, looking convincing. But n=4n=4: 16+4+1=21=3×716+4+1=21=3\times7, not prime. n=4n=4 is a counter-example, so Ali is wrong.

06 — Explanation

How do "show that" geometry proofs work?

  1. Identify the geometric principle (Pythagoras, area of a rectangle/trapezium, etc.).
  2. Substitute the given algebraic lengths into the formula and set equal to the given value.
  3. Expand and rearrange until it exactly matches the target equation — show every line.

Worked example: A right-angled triangle has sides xx, (x+2)(x+2), (x+3)(x+3) cm (hypotenuse x+3x+3). Show the equation simplifies to x2−2x−5=0x^2-2x-5=0.

By Pythagoras: x2+(x+2)2=(x+3)2x^2+(x+2)^2=(x+3)^2

x2+x2+4x+4=x2+6x+9  ⟹  2x2+4x+4=x2+6x+9x^2+x^2+4x+4 = x^2+6x+9 \implies 2x^2+4x+4 = x^2+6x+9
x2−2x−5=0✓x^2-2x-5=0 \quad \checkmark

Exam Tip

In "show that" questions, Part (b) usually asks you to use the given target equation — so even if you can't complete the derivation in Part (a), you can still solve Part (b) using the equation as given, and pick up those marks.

07 — Worked example

Worked exam-style question

If nn is an integer greater than 1, prove that n3−nn^3-n is a multiple of 6.

Factorise: n3−n=n(n2−1)=n(n−1)(n+1)=(n−1)(n)(n+1)n^3-n = n(n^2-1) = n(n-1)(n+1) = (n-1)(n)(n+1).

This is the product of three consecutive integers. Among any three consecutive integers, at least one is even (a multiple of 2) and exactly one is a multiple of 3. So the product is divisible by both 2 and 3, hence by 2×3=62\times3=6. Therefore n3−nn^3-n is always a multiple of 6.