Revision Library
Choose a subject
Menu
Further Maths
Need a new topic?
Missing a topic, found a bug, or want something added?

A Level Further Maths worksheets

33 packs

Core Pure Mathematics

15 packsCore Pure Mathematics worksheets

Decision Mathematics

6 packsDecision Mathematics worksheets

Further Mechanics

6 packsFurther Mechanics worksheets

Further Statistics

6 packsFurther Statistics worksheets

Free for personal and classroom use - see copyright & terms.

worksheet packs
33
question pages
281
printable pages
415
mark schemes
33

"Question pages": Pages that carry questions, not the mark scheme. "Printable pages": Every page in the PDF, questions and the mark scheme together.

Choosing a Further Mathematics method

Further Mathematics brings together work where the choice of representation matters as much as the calculation. A system of equations can become a matrix equation; a sorting problem needs an algorithm with a recorded sequence of decisions. Use the Core Pure material to strengthen complex numbers, matrices, algebra and calculus, then select the applied strand that matches your course and the task in front of you. The Further Mathematics guides give the definitions and worked reasoning behind the catalogue topics, including Further Mechanics, Further Statistics and Decision Maths.

Before choosing a sheet, identify what the question asks you to demonstrate. An exact value, a proof, a model and an algorithm trace require different kinds of working. For matrices, dimensions and multiplication order are part of the argument. For algorithms, the intermediate lists or labels show that the prescribed procedure was followed. For mechanics and statistics, record the assumptions that make the model appropriate. Return to the relevant guide when you can recognise a topic but cannot justify the next operation; move on to practice when you can explain both the method and its checks.

Use matrices to represent a system

Begin with matrices and inverses when simultaneous equations need a compact representation. Keep the coefficient matrix, unknown column and constant column in a consistent order. The determinant decides whether the inverse method is available; it is not simply an extra calculation to attach at the end.

Multiplication order matters. Apply the inverse on the left to recover the unknown column, then substitute the resulting values into the original equations. This checks the representation as well as the arithmetic. A correct inverse paired with the wrong constants can still produce an incorrect solution.

Worked example. Given A = [[1,2],[3,5]], find det(A), find A^-1, and hence solve the simultaneous equations x + 2y = 7 and 3x + 5y = 16.

  1. Compute det(A) = 1*5 - 2*3 = 5 - 6 = -1. This is non-zero, so A has an inverse and the system has a unique solution.
  2. For a 2 by 2 inverse, swap the leading-diagonal entries, negate the other two entries and divide every entry by det(A): A^-1 = (1/(-1))*[[5,-2],[-3,1]] = [[-5,2],[3,-1]].
  3. Write the equations as Av = b, where v = [x,y]^T and b = [7,16]^T. Multiply both sides on the left by A^-1: A^-1 Av = A^-1 b. Since A^-1 A = I, this leaves v = A^-1 b; matrix division is not needed.
  4. Use each row of A^-1 with the column b: x = (-5)*7 + 2*16 = -35 + 32 = -3, and y = 3*7 + (-1)*16 = 21 - 16 = 5.
  5. Check in the original equations: -3 + 2*5 = 7 and 3*(-3) + 5*5 = 16. Both right-hand sides are recovered.
  6. Final answer: det(A) = -1, A^-1 = [[-5,2],[3,-1]], and the unique solution is x = -3, y = 5.

Answer: Final answer: det(A) = -1, A^-1 = [[-5,2],[3,-1]], and the unique solution is x = -3, y = 5.

Record an algorithm rather than only its result

Move to sorting algorithms when the task prescribes a procedure. In quick sort, the stated pivot rule determines the next split, so record the pivot and the remaining sublists at each stage. A sorted list alone hides whether that rule was followed.

This differs from the matrix check: substitution confirms a proposed solution, whereas an algorithm trace demonstrates the route taken to the output. Keep single-item sublists in position and continue only with those still needing a split. The stopping condition is part of the method, not a guess based on how tidy the list looks.

Worked example. The list 25, 11, 33, 4, 18, 7 is to be sorted into ascending order using quick sort, choosing the first item of each sublist as the pivot. Carry out the full sort, showing the sublists produced at each stage.

  1. First pivot = 25 (the first item). Comparing each remaining item (11, 33, 4, 18, 7) to 25: those less than 25 form the sublist [11, 4, 18, 7] in their original order, and those greater form the sublist [33]. This gives [11, 4, 18, 7] | 25 | [33].
  2. The sublist [33] has one item, so it needs no further sorting. Apply quick sort to [11, 4, 18, 7]: pivot = 11. The remaining items 4, 18, 7 split into [4, 7] (less than 11) and [18] (greater than 11), giving [4, 7] | 11 | [18].
  3. [18] has one item, so it is done. Apply quick sort to [4, 7]: pivot = 4. The remaining item 7 is greater than 4, so the less-than sublist is empty and the greater-than sublist is [7], giving 4 | [7].
  4. Every sublist now has at most one item, so sorting is complete. Reading the sublists in order gives 4, 7, 11, 18, 25, 33.
  5. Final answer: sorted list is 4, 7, 11, 18, 25, 33.

Answer: Final answer: sorted list is 4, 7, 11, 18, 25, 33.

Keep going

Build these into a personalised pack.

Sitting an exam soon? Build a A Level Further Maths mock paper or print a ready-made one.