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

Book 1 of 2

A Level Further Maths 10-Minute Tests 1

Complex Numbers, Matrices, Further Algebra and Roots and 14 more

Level
A Level · Edexcel 9FM0 · AQA 7367 · OCR H245
Series
A Level Further Maths 10-Minute Tests, book 1 of 2
Suitable for
Years 12-13, AQA / Edexcel / OCR
FreePDF download · 2027 edition · 54 A4 pages
  • One file, prints straight to A4
  • No account, no password

Workbooks like this one, with 17 topics, 18 questions and mark schemes at the back, are usually printed and sold by publishers. This one is one of 558 free PDFs on the shelf.

Pages
54 A4 pages
Chapters
17 worksheet chapters
Questions
18
Answers
From page 38
Working time
About 2h 50m

What is inside

17 chapters · answers from p38

Each chapter starts with a page showing its marks and a suggested time, followed by the questions. The mark schemes for all 17 chapters are at the back, so the book works for homework, a timed test or revision.

  1. 01Complex Numbers1 questions · about 10 min Topic guide: Complex Numbersp3
  2. 02Matrices1 questions · about 10 min Topic guide: Matricesp5
  3. 03Further Algebra and Roots1 questions · about 10 min Topic guide: Further Algebra and Rootsp7
  4. 04Further Calculus2 questions · about 10 min Topic guide: Further Calculusp9
  5. 05Further Vectors1 questions · about 10 min Topic guide: Further Vectorsp11
  6. 06Polar Coordinates1 questions · about 10 min Topic guide: Polar Coordinatesp13
  7. 07Hyperbolic Functions1 questions · about 10 min Topic guide: Hyperbolic Functionsp15
  8. 08Differential Equations1 questions · about 10 min Topic guide: Differential Equationsp17
  9. 09Proof by Induction1 questions · about 10 min Topic guide: Proof by Inductionp19
  10. 10Series and Summation1 questions · about 10 min Topic guide: Series and Summationp21
  11. 11Maclaurin Series1 questions · about 10 min Topic guide: Maclaurin Seriesp23
  12. 12Core Pure: Complex Numbers Depth1 questions · about 10 min Topic guide: Core Pure: Complex Numbers Depthp25
  13. 13Core Pure: Matrices and Transformations Depth1 questions · about 10 min Topic guide: Core Pure: Matrices and Transformations Depthp27
  14. 14Core Pure: Further Calculus and Series Depth1 questions · about 10 min Topic guide: Core Pure: Further Calculus and Series Depthp29
  15. 15Core Pure: Polar Coordinates and Hyperbolic Functions Depth1 questions · about 10 min Topic guide: Core Pure: Polar Coordinates and Hyperbolic Functions Depthp31
  16. 16Decision Maths: Algorithms, Sorting and Bin Packing1 questions · about 10 min Topic guide: Decision Maths: Algorithms, Sorting and Bin Packingp33
  17. 17Decision Maths: Graphs, Trees and Minimum Spanning Trees1 questions · about 10 min Topic guide: Decision Maths: Graphs, Trees and Minimum Spanning Treesp35
  18. AnswersMark schemes for every chapterp38

Each chapter is drawn from one of our worksheet packs. Follow a chapter title for the full pack on its own page, or browse every A Level Further Maths pack. Every book on the shelf is a complete printable workbook of up to 120 A4 pages.

Explore this volume

A Level Further Maths 10-Minute Tests 1 includes Complex Numbers (from page 3); Matrices (from page 5); Further Algebra and Roots (from page 7); Further Calculus (from page 9); Further Vectors (from page 11); Polar Coordinates (from page 13); Hyperbolic Functions (from page 15); Differential Equations (from page 17); Proof by Induction (from page 19); Series and Summation (from page 21); Maclaurin Series (from page 23); Core Pure: Complex Numbers Depth (from page 25); Core Pure: Matrices and Transformations Depth (from page 27); Core Pure: Further Calculus and Series Depth (from page 29); Core Pure: Polar Coordinates and Hyperbolic Functions Depth (from page 31); Decision Maths: Algorithms, Sorting and Bin Packing (from page 33); Decision Maths: Graphs, Trees and Minimum Spanning Trees (from page 35).

Worked question 1 - Decision Maths: Algorithms, Sorting and Bin Packing

Open the included worksheet

This question uses known comparison-count formulas to compare the efficiency of a bubble sort and a quicksort as the size of the list, n, grows large.
(a)The number of comparisons made by a bubble sort in the worst case, on a list of n items, is given by n(n - 1)/2. Calculate the worst-case number of comparisons for (i) n = 50, (ii) n = 200, (iii) n = 1024.(3)
(b)Given that n increased by a factor of 4 between parts (a)(i) and (a)(ii), show that the ratio of your two answers is consistent with the bubble sort's worst-case order of O(n2).(2)
(c)A quicksort, on average, makes approximately n log2(n) comparisons to sort a list of n items. Calculate the approximate number of comparisons a quicksort would make, on average, to sort a list of n = 1024 items.(2)
(d)By comparing your answer to part (c) with your answer to part (a)(iii), comment on the practical significance, for large n, of the difference in order between an O(n log n) algorithm and an O(n2) algorithm.(2)

Answer and mark scheme

Question 1

CreditAnswer or working
B1(a) (i) 1225 cao (50 x 49 / 2)
B1(a) (ii) 19900 cao (200 x 199 / 2)
B1(a) (iii) 523776 cao (1024 x 1023 / 2)
M1(b) correctly calculates the ratio 19900 / 1225 = 16.24... (awrt 16.2)
A1(b) compares this to 42 = 16 and concludes the closeness confirms the order O(n2) (the small difference from exactly 16 is because n(n-1)/2 also has a lower-order term, becoming negligible for large n) (oe)
M1(c) uses log2(1024) = 10 (since 210 = 1024)
A1(c) 1024 x 10 = 10240 comparisons cao
B1(d) for n = 1024, quicksort's average 10240 comparisons is far smaller than bubble sort's worst-case 523776 comparisons, roughly 51 times fewer (oe, allow awrt 50)
B1(d) as n grows large, an O(n log n) algorithm remains practical while an O(n2) algorithm's run time grows far more quickly, so the difference in order becomes increasingly significant for large data sets (oe)
  • (a) Answer: (i) 1225; (ii) 19900; (iii) 523776.
  • (b) Answer: Ratio approx 16.2, close to 42 = 16, consistent with worst-case order O(n2).
  • (c) Answer: Approximately 10240 comparisons.
  • (d) Answer: Quicksort's estimate (10240) is roughly 51 times smaller than bubble sort's worst case (523776); as n grows, this gap widens further, so the choice of algorithm order matters far more for large data sets.

Question 2 - Further Calculus

Open the included worksheet

This question is about improper integrals.
(a)Show that the improper integral of 1/x from x = 1 to infinity does not converge.(3)

Answer and mark scheme

Question 2

CreditAnswer or working
M1(a) integrates: 1 ln x
M1(a) evaluates between 1 and t
A1(a) 1 ln t tends to infinity as t tends to infinity, so the integral diverges
  • (a) Answer: diverges

A Level Further Maths 10-Minute Tests runs to 2 volumes

Book 1 of 2 · 109 pages in the set

Each book is a separate free PDF.

Volume 1 · this book

54 pp · 18 Qs

Complex Numbers, Matrices, Further Algebra and Roots and 14 more

Volume 2

55 pp · 18 Qs

Decision Maths: Shortest Paths and Route Inspection, Decision Maths: Critical Path Analysis and Linear Programming, Decision: Algorithms and Graph Theory Depth and 13 more

More A Level books

A Level Further Maths Decision Topic Workbook

71 pp · 60 Qs

Decision Maths: Algorithms, Sorting and Bin Packing, Decision Maths: Graphs, Trees and Minimum Spanning Trees, Decision Maths: Shortest Paths and Route Inspection and 3 more

Want a different mix of topics?

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