Proof
P4 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 P4 paper (WMA14) is 1 hour 30 minutes and 75 marks. It assumes P1 to P3 and finishes the A level pure content: proof by contradiction, partial fractions, parametric equations, the general binomial series, implicit differentiation, harder integration, differential equations and vectors.
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.1Proof by contradiction
Prove a statement by assuming it is false and showing this leads to something impossible; know the proofs that \(\sqrt2\) is irrational and that there are infinitely many primes.
The idea
To prove \(S\) is true: assume \(S\) is false, then reason correctly until you reach something impossible (a contradiction). Since correct reasoning can't produce nonsense from a true starting point, the assumption must be wrong. So \(S\) is true.
Structure (each part earns marks):
- Assume the opposite, clearly: "Assume there is a positive \(k\) with \(k + \frac9k < 6\)."
- Reason with algebra.
- Contradiction: point out the impossible statement and why it's impossible.
- Conclude: "so the assumption is false, and \(k + \frac9k \geqslant 6\) for all \(k > 0\)."
The two proofs you must know
\(\sqrt2\) is irrational. Assume \(\sqrt2 = \frac{a}{b}\) with \(a\), \(b\) integers with no common factor. Then \(a^2 = 2b^2\), so \(a^2\) is even, so \(a\) is even: \(a = 2c\). Then \(4c^2 = 2b^2\), so \(b^2 = 2c^2\) and \(b\) is even too. Both even contradicts "no common factor". So \(\sqrt2\) is irrational.
There are infinitely many primes. Assume there are finitely many: \(p_1, p_2, \ldots, p_n\). Let \(N = p_1p_2\cdots p_n + 1\). Dividing \(N\) by any \(p_i\) leaves remainder 1, so none of them divides \(N\). So \(N\) is prime or has a prime factor not on the list. Either way the list wasn't complete: contradiction.
an inequality
Prove by contradiction that \(k + \dfrac9k \geqslant 6\) for all positive \(k\).
Assume there is a positive \(k\) with \(k + \frac9k < 6\).
Multiply by \(k\) (\(k > 0\), so the inequality keeps its direction): \(k^2 + 9 < 6k \Rightarrow k^2 - 6k + 9 < 0 \Rightarrow (k - 3)^2 < 0\).
A square can't be negative: contradiction. So \(k + \frac9k \geqslant 6\) for all \(k > 0\).
integers
Prove there are no positive integers \(p\) and \(q\) with \(4p^2 - q^2 = 46\).
Assume there are. Then \((2p + q)(2p - q) = 46\). Both factors are integers and \(2p + q > 0\), so the pairs are \((46, 1)\) or \((23, 2)\).
\(2p + q = 46\), \(2p - q = 1\): adding gives \(4p = 47\), not an integer.
\(2p + q = 23\), \(2p - q = 2\): adding gives \(4p = 25\), not an integer.
Both cases contradict \(p\) being an integer, so no such \(p\) and \(q\) exist.
- B1 for the assumption, which must use a word like "assume" and the correct opposite (a strict inequality here), M1 for the algebra, A1 for \((k - 3)^2 < 0\), A1* for the reason and conclusion (WMA14 Oct 2023 Q4).
- Factor-pair proofs: M1 A1 for one pair solved, dM1 for both, A1* for a full argument (WMA14A Jan 2026 Q8).
Often asked as: one of the two standard proofs; an unfamiliar inequality or integer statement; trig versions such as showing a modulus is less than 1 for angles in an interval (WMA14 Jun 2025 Q10).
Assuming the wrong opposite: the opposite of "\(\geqslant 6\) for all \(k\)" is "\(< 6\) for some \(k\)".
No final conclusion.
Multiplying by a variable whose sign you haven't checked.