Proof

P2 Topic 1, spec point by spec point (Proof). Each spec point has the method, worked examples written the way the mark scheme wants them, how the marks go and the mistakes that cost the most marks.

The P2 paper (WMA12) is 1 hour 30 minutes and 75 marks. It builds directly on P1: polynomials, circles, sequences, logarithms, trigonometric equations and the uses of differentiation and integration.

How maths marks work

M marks are for a correct method, even with a slip in the numbers. A marks are for accurate answers and need the M mark before them. B marks stand alone (a value or a statement). dM means the method mark depends on an earlier M mark.

ft (follow through) lets a later mark be earned from your own earlier wrong value. cso (correct solution only) means every step must be right, which is common on "show that" answers. awrt means "answers which round to", so keep extra figures and round at the end. isw means extra working after a correct answer is ignored.

When a question says "use algebra", "show all stages of your working" or "solutions relying on calculator technology are not acceptable", an answer with no method scores nothing, even if it is right.

Each spec point below has the idea behind it first, then the method, worked examples written the way a mark scheme would want, how the marks go, and the mistakes that cost the most marks. The paper references, such as (WMA11 Jan 2022 Q4), are past questions from the IAL Prep question bank that use the point.

Spec1.1The structure of a proof

Write a proof that starts from what you are given, moves through clear logical steps, and ends with a conclusion.

The idea

A proof shows something is true in every case, not just the ones you tried. Checking examples convinces you; it doesn't prove anything (unless there are only a few cases, see 1.2).

A good proof has three parts:

  1. Set-up: write the objects in algebra. An even number is \(2n\), an odd number is \(2n + 1\), consecutive integers are \(n\) and \(n + 1\), consecutive odd numbers are \(2n - 1\) and \(2n + 1\).
  2. Steps: each line follows from the one before. Use \(\Rightarrow\) only when it is true.
  3. Conclusion: say in words what you have shown, linked back to the statement. "\(8n\) is a multiple of 8, so \(p^2 - q^2\) is always a multiple of 8."

Useful facts to start from

consecutive odd numbers

Prove that if \(p\) and \(q\) are consecutive odd numbers with \(p > q > 0\), then \(p^2 - q^2\) is a multiple of 8.

Let \(q = 2n - 1\) and \(p = 2n + 1\), where \(n\) is a positive integer.

\(p^2 - q^2 = (p - q)(p + q) = (2)(4n) = 8n\).

\(8n\) is a multiple of 8, so \(p^2 - q^2\) is a multiple of 8 for all such \(p\) and \(q\).

a curve with no stationary points

Prove that \(y = x^3 + 12x^2 + 49x + 2\) has no stationary points.

\(\dfrac{dy}{dx} = 3x^2 + 24x + 49\). Stationary points need \(\dfrac{dy}{dx} = 0\).

Discriminant: \(24^2 - 4(3)(49) = 576 - 588 = -12 < 0\), so \(\dfrac{dy}{dx} = 0\) has no real roots.

So the curve has no stationary points.

an inequality

Prove that for all positive \(x\) and \(y\), \(\dfrac{x + y}{2} \geqslant \sqrt{xy}\).

Since \(x, y > 0\), \(\sqrt x\) and \(\sqrt y\) are real. \((\sqrt x - \sqrt y)^2 \geqslant 0\) because it is a square.

Expanding: \(x - 2\sqrt{xy} + y \geqslant 0\), so \(x + y \geqslant 2\sqrt{xy}\), and dividing by 2 gives \(\dfrac{x + y}{2} \geqslant \sqrt{xy}\).

  • B1 for writing the numbers in a suitable algebraic form, M1 for starting the algebra in one variable, A1 for correct expansion, A1* for the result with a conclusion (WMA12 Jan 2026 Q6).
  • Inequality proofs: the final A1* needs a reason for each step, including why a square root can be taken (WMA12 Oct 2021 Q9a).

Often asked as: two short proofs in one question; a "show that" about consecutive or odd numbers; prove an expression is always positive.

Using two different letters for consecutive numbers (\(2n + 1\) and \(2m + 1\)): they are no longer consecutive.

Starting from what you want to prove and working towards something true, without the steps being reversible.

No concluding sentence: the last mark is often for it.

Spec1.2Proof by exhaustion

Prove a statement by checking every possible case.

The idea

If there are only a few cases, check them all. That is a proof, because nothing is left out. Two versions:

You must show every case and end with a conclusion that all cases have been covered.

a finite list

Prove that \(f(n) = 168n - 119 - 24n^2\) is a perfect square for all positive integers \(n < 7\).

\(n\) 1 2 3 4 5 6
\(f(n)\) \(25 = 5^2\) \(121 = 11^2\) \(169 = 13^2\) \(169 = 13^2\) \(121 = 11^2\) \(25 = 5^2\)

Every positive integer \(n < 7\) has been checked and each gives a perfect square, so the statement is true.

odd and even cases

Prove that \(n^2 - 2\) is never a multiple of 4 for any integer \(n\).

\(n\) even, \(n = 2p\): \(n^2 - 2 = 4p^2 - 2 = 4(p^2 - 1) + 2\), which leaves remainder 2 when divided by 4.

\(n\) odd, \(n = 2p + 1\): \(n^2 - 2 = 4p^2 + 4p - 1 = 4(p^2 + p) - 1\), which is 1 less than a multiple of 4.

Every integer is even or odd, so \(n^2 - 2\) is never a multiple of 4.

  • M1 for trying some cases, M1 for all cases with some correct, A1 for all values correct and a conclusion. Including cases outside the range (like \(n = 0\) or \(n = 7\)) loses the A mark (WMA12A Jun 2026 Q10).
  • Case-splitting: M1 for \(n = 2p\) or \(n = 2p + 1\) expanded, A1 for each case with a reason (WMA12 Jan 2024 Q8).

Often asked as: a table of values in the answer book; an "even and odd" argument; finding all sets of positive integers that satisfy a condition and checking each (WMA12 Oct 2023 Q1).

Missing a case, or checking extra ones the statement doesn't cover.

Showing values but not that each is a square (or a multiple, or prime).

Spec1.3Disproof by counterexample

Show a statement is false by finding one case where it fails.

The idea

"For all \(n\)" claims are destroyed by a single case that doesn't work. You need:

  1. one specific value;
  2. the working that shows the statement fails for it;
  3. a sentence saying so.

A good strategy: try small values in order. Many false statements work for the first few values (that's why people believe them).

a prime formula

Show that "\(n^2 + 3n + 1\) is prime for all positive integers \(n\)" is false.

\(n = 1, 2, 3, 4, 5\) give 5, 11, 19, 29, 41, all prime. But \(n = 6\): \(36 + 18 + 1 = 55 = 5 \times 11\).

55 is not prime, so the statement is false.

irrational numbers

Show by counterexample that "if \(x\) and \(y\) are different irrational numbers, \(xy\) is irrational" is false.

\(x = \sqrt2\), \(y = \sqrt8\): both irrational and different. \(xy = \sqrt{16} = 4\), which is rational. So the statement is false.

  • M1 for substituting a value that gives a counterexample, A1 for the correct calculation and a conclusion (e.g. "55 is not prime") (WMA12 Jan 2024 Q8).
  • The product must be shown to be rational: writing "\(2 \times 8 = 16\)" instead of \(\sqrt2 \times \sqrt8 = 4\) is not enough (WMA12 Jan 2025 Q8).
  • Showing something is not a cube or not a square needs a reason, e.g. "175 lies between \(5^3 = 125\) and \(6^3 = 216\)" (WMA12 Jun 2026 Q4).

Often asked as: the first, short part of a proof question; show an inequality fails when the variables are negative (WMA12 Oct 2021 Q9b).

Giving a value without the calculation.

Using several examples that work and calling it a proof.