Further Pure Mathematics 1: Cambridge 9231 Revision Guide

What Further Pure 1 Covers (9231 Paper 1)

Paper 1 of the Cambridge 9231 Further Mathematics syllabus is a 3-hour paper worth 120 marks. It consists entirely of structured questions — no MCQ component. The syllabus is divided into seven areas: polynomials and rational functions, polar coordinates, summation of series, mathematical induction, differentiation and integration (advanced techniques), complex numbers, and matrices. Each topic typically appears as at least one full question, so there is no safe topic to skip.

The paper rewards precision, rigour, and fluency. Unlike Pure Mathematics where a correct final answer can sometimes rescue weak working, Further Pure 1 questions are structured so that each part depends on the previous one. A sign error in part (a) will propagate through parts (b) and (c). Examiners award follow-through marks, but only if your method is clearly shown and logically consistent.

Polynomials and Rational Functions

This topic requires you to use relationships between roots and coefficients of polynomials. For a cubic with roots α, β, γ, you must be able to find symmetric functions like Σα², Σα²β², and Σα³ using Newton's identities or direct expansion. The key technique is expressing any symmetric function in terms of the elementary symmetric polynomials (Σα, Σαβ, αβγ).

For rational functions, you need to decompose into partial fractions, sketch graphs identifying asymptotes and stationary points, and solve inequalities. A common exam question gives a substitution (e.g. y = x + 1/x) and asks you to find the equation whose roots are a function of the original roots. Practise these transformations until the algebraic manipulation is fluent — they appear in almost every session.

Polar Coordinates

You need to sketch polar curves (r = a(1 + cosθ), r = a cos 2θ, r² = a² cos 2θ, and similar forms), find tangents at the pole, and calculate enclosed areas using the formula A = ½∫r² dθ. The most important skill is knowing how the curve behaves as θ varies — identify where r = 0, where r is maximum, and the symmetry of the curve before plotting points.

Area calculations require careful attention to limits of integration. For curves like r = a cos 2θ (four-petalled rose), each petal spans a specific θ-range, and you must integrate over one petal then multiply — not integrate from 0 to 2π blindly, because r² can become negative for r² = a² cos 2θ curves. Draw the curve first, identify the correct limits, then set up the integral.

Summation of Series

This topic covers three main techniques: method of differences (telescoping), standard results for Σr, Σr², Σr³, and partial fractions combined with telescoping. The method of differences is the most frequently examined: decompose the general term using partial fractions, write out several terms to identify cancellation, then state the sum.

The common pitfall is algebraic carelessness in the partial fraction decomposition. A single sign error means the terms will not telescope correctly. Always verify your decomposition by substituting a value of r back into the original expression before proceeding. Also, remember to state the sum to n terms explicitly and simplify fully — examiners deduct marks for unsimplified answers.

Mathematical Induction

Proof by induction appears in virtually every Further Pure 1 paper. You must know the four-step structure: (1) state the proposition P(n), (2) verify the base case P(1) or P(0), (3) assume P(k) is true (the inductive hypothesis) and prove P(k+1), (4) write a formal conclusion stating that by induction, P(n) is true for all n ≥ 1 (or the appropriate domain).

Cambridge examiners are strict about the conclusion. Writing "therefore true by induction" without referencing the base case and the inductive step will lose you the final mark. The correct conclusion is: "P(1) is true, and P(k) true implies P(k+1) true, so by the principle of mathematical induction, P(n) is true for all positive integers n."

Induction questions can involve summation formulas, divisibility, matrix powers, or inequalities. For matrix induction, the inductive step usually involves multiplying M^k by M and using the hypothesis about M^k. For divisibility, express f(k+1) - f(k) or f(k+1) in terms of f(k) plus a term that is clearly divisible by the required factor. Practise at least two examples of each type.

Differentiation and Integration (Advanced Techniques)

Further Pure 1 extends your calculus toolkit significantly. For differentiation, you need implicit differentiation, parametric differentiation (including second derivatives via the chain rule), and Maclaurin series expansions. For integration, you need reduction formulas, integration using partial fractions with irreducible quadratic denominators, arc length, and surface area of revolution.

Reduction formulas are a perennial exam favourite. You will be asked to derive a recurrence relation for I_n = ∫f(x, n) dx, typically using integration by parts, then use the formula to evaluate specific cases. The derivation requires careful choice of "u" and "dv" in integration by parts — if the integral does not simplify after one application, try the other assignment.

For Maclaurin series, memorise the standard expansions for e^x, sin x, cos x, ln(1+x), and (1+x)^n. Most exam questions ask you to find the Maclaurin series of a composite function by substituting into a known series or by multiplying two series together. Show the first three or four non-zero terms unless the question specifies otherwise.

Complex Numbers

The complex numbers topic in Further Pure 1 goes well beyond what you learned in Pure Mathematics. You need modulus-argument (polar) form, multiplication and division in polar form, de Moivre's theorem, nth roots of unity, and loci in the Argand diagram.

De Moivre's theorem is the centrepiece. You must be able to use it to express cos(nθ) and sin(nθ) in terms of powers of cosθ and sinθ, and conversely to express powers of cosθ and sinθ in terms of multiple angles. The technique involves expanding (cosθ + i sinθ)^n using the binomial theorem and equating real and imaginary parts. Practise this until it is automatic — it appears in some form in most sessions.

For loci, remember the key forms: |z - a| = r is a circle, |z - a| = |z - b| is a perpendicular bisector, and arg(z - a) = θ is a half-line. The combination |z - a|/|z - b| = k gives a circle (Apollonius circle) when k ≠ 1. Sketch each locus clearly, label key points, and shade the correct region if the question involves an inequality.

Matrices

Matrix questions in Further Pure 1 cover determinants, inverses (2×2 and 3×3), systems of linear equations, eigenvalues and eigenvectors, and matrix transformations. The most commonly examined skill is finding eigenvalues by solving det(A - λI) = 0 and then finding the corresponding eigenvectors.

For 3×3 systems, you need to handle all three cases: unique solution (non-zero determinant), no solution (inconsistent system), and infinitely many solutions (consistent dependent system). Cambridge often asks you to find the value of a parameter for which the system does not have a unique solution, then determine whether the resulting system is inconsistent or has infinitely many solutions. Show your row reduction clearly — examiners want to see each step.

Diagonalisation (A = PDP⁻¹) may also be examined. If A has n linearly independent eigenvectors, form P from the eigenvectors and D from the eigenvalues on the diagonal. This makes computing A^n straightforward: A^n = PD^nP⁻¹. Link this to induction — you may be asked to prove A^n = PD^nP⁻¹ by induction on n.

Exam Strategy for the 3-Hour Paper

Time allocation. With 120 marks in 180 minutes, you have exactly 1.5 minutes per mark. A 12-mark question should take no more than 18 minutes. If you are spending significantly longer, move on and return later — the marks at the end of the paper are worth the same as those at the start.

Show all working in proof questions. Further Pure 1 has more "show that" and "prove that" questions than any other Cambridge maths paper. In these questions, every logical step must be written explicitly. Jumping from the hypothesis to the conclusion without showing the intermediate algebra will cost you method marks even if your final line is correct.

Check your answers where possible. After finding eigenvalues, verify by checking that the trace of A equals the sum of eigenvalues and the determinant equals their product. After summing a series, substitute small values of n to check. After finding a Maclaurin series, evaluate at a known point (e.g. x = 0 or x = 1 if convergent) to confirm. These checks take seconds and catch arithmetic errors.

Read the question precisely. "Hence" means you must use the result you just proved. "Hence or otherwise" means the intended method uses that result but alternatives are accepted. "Deduce" means derive from a previous result without starting from scratch. Ignoring these cues wastes time and can cost marks.

Recommended Resources

Cambridge past papers (official). Paper 1 from the 9231 syllabus. Work through at least six full papers under timed conditions in the final month of revision. Earlier in your preparation, use individual questions topic-by-topic.

Nexelia. Provides 790 Cambridge-aligned MCQs and 601 exam questions with full worked solutions for Further Pure Mathematics 1, organised by chapter. The worked solutions include detailed commentary on method choices — particularly useful for reduction formulas, induction proofs, and matrix questions where the "right" approach is not always obvious.

Your textbook. The endorsed Cambridge Further Mathematics coursebook (Prior & Quadling or Lee) covers all seven topics with worked examples and exercises. Use it for initial learning, but move to exam-style questions as soon as you are comfortable with the basics.

Mistakes That Cost Marks in Further Pure 1

• Incomplete induction conclusions. Writing "true by induction" without referencing both the base case and the inductive step. The conclusion must explicitly state that P(1) was verified and that P(k) ⇒ P(k+1) was proved.
• Forgetting to state the modulus and argument when converting to polar form. When a question asks for z in the form r(cosθ + i sinθ), you must give both r (as a positive real number) and θ (in the correct range, usually -π < θ ≤ π). Giving θ outside this range or as a decimal without an exact form loses marks.
• Sign errors in the characteristic equation. When computing det(A - λI) for a 3×3 matrix, cofactor expansion is error-prone. Double-check by verifying that the constant term equals det(A) and the coefficient of λ² equals -trace(A).
• Wrong limits in polar area integrals. For curves that pass through the pole (r = 0), the limits of integration must correspond to the angles where r = 0, not 0 and 2π. Integrating over a range where r is negative gives a meaningless result.
• Skipping verification in "show that" questions. If the question says "show that the sum is n(n+1)/2," you must arrive at exactly that expression through valid algebra. Writing the target expression and working backwards, or stating "which equals the required result" without showing the simplification, will not earn full marks.
• Not simplifying series sums fully. After telescoping, the remaining terms must be combined into a single fraction or simplified expression. Leaving your answer as a sum of two or three separate fractions when a simpler form exists will cost you the final accuracy mark.