Skip to content

Edexcel A Level · Free tool

Edexcel A Level Further Mathematics (9FM0) Test Generator

Make a free Edexcel A Level Further Mathematics (9FM0) practice test from real past-paper questions across 58 syllabus topics. Choose topics, papers and a mark target, then download the question paper and mark scheme as PDFs.

Build your 9FM0 test

Paper
Topics (58 of 58)

Apollo draws from up to 24 topics per test, so it will use the first 24 you selected.

Total marks
Years (any)

Your test will appear here

Pick topics and a mark target, then generate. You get a printable question paper and a matching mark scheme, both as PDFs.

9FM0 topics you can include

Every topic below has real past-paper questions with official mark schemes.
  • Proof4 questions
  • Complex numbers15 questions
  • Matrices6 questions
  • Further algebra and functions9 questions
  • Further calculus10 questions
  • Further vectors4 questions
  • Polar coordinates6 questions
  • Hyperbolic functions6 questions
  • Differential equations10 questions
  • Derivation and use of Taylor series7 questions
  • Use of Taylor series method for series solution of differential equations5 questions
  • Cartesian and parametric equations for the parabola and rectangular hyperbola, ellipse and hyperbola5 questions
  • The vector product a × b of two vectors3 questions
  • Numerical solution of first order and second order differential equations3 questions
  • Algebraic inequalities and inequations2 questions
  • The Axioms of a group3 questions
  • Further calculus: reduction formulae (FP2)5 questions
  • Eigenvalues and eigenvectors of 2 × 2 and 3 × 3 matrices3 questions
  • Further loci and regions in the Argand diagram5 questions
  • An understanding of the division theorem and its application to the Euclidean Algorithm and congruences5 questions
  • First and second order recurrence relations4 questions
  • Calculation of the mean and variance of discrete probability distributions3 questions
  • The Poisson distribution2 questions
  • Geometric and negative binomial distributions6 questions
  • Extend ideas of hypothesis tests to test for the mean of a Poisson distribution4 questions
  • Applications of the Central Limit Theorem to other distributions2 questions
  • Goodness of fit tests and Contingency Tables4 questions
  • Probability generating functions (FS1)4 questions
  • Type I and Type II errors3 questions
  • Least squares linear regression4 questions
  • The concept of a continuous random variable7 questions
  • Use of formulae to calculate the product moment correlation coefficient2 questions
  • Distribution of linear combinations of independent Normal random variables4 questions
  • Concepts of standard error, estimator, bias6 questions
  • Hypothesis test and confidence interval for the variance of a Normal distribution4 questions
  • Hypothesis test and confidence interval for the mean of a Normal distribution with unknown variance5 questions
  • Momentum and impulse. The impulse-momentum principle5 questions
  • Kinetic and potential energy, work and power5 questions
  • Elastic strings and springs (FM1)3 questions
  • Direct impact of elastic spheres3 questions
  • Oblique impact of smooth elastic spheres and a smooth sphere with a fixed surface6 questions
  • Motion in a circle (FM2)8 questions
  • Moment of a force. Centre of mass of a discrete mass distribution in one and two dimensions7 questions
  • Centre of mass of uniform and non-uniform rigid bodies and composite bodies7 questions
  • Newton's laws of motion, for a particle moving in one dimension, when the applied force is variable6 questions
  • Kinematics of a particle moving in a straight line when the acceleration is a function of the displacement (x), or time (t) or velocity (v)2 questions
  • The general ideas of algorithms and the implementation of an algorithm given by a flow chart or text5 questions
  • The minimum spanning tree (minimum connector) problem. Prim's and Kruskal's algorithm4 questions
  • Algorithm for finding the shortest route around a network, travelling along every edge at least once and ending at the start vertex (The Route Inspection Algorithm)1 questions
  • Modelling of a project by an activity network, from a precedence table4 questions
  • Formulation of problems as linear programs including the meaning and use of slack, surplus and artificial variables4 questions
  • The north-west corner method for finding an initial basic feasible solution4 questions
  • Cost matrix reduction. Use of the Hungarian algorithm to find a least cost allocation4 questions
  • Cuts and their capacity4 questions
  • Principles of dynamic programming. Bellman's principle of optimality4 questions
  • Two person zero-sum games and the pay-off matrix4 questions
  • Use of recurrence relations to model appropriate problems7 questions
  • Use, construct and interpret decision trees4 questions