Sequences and recurrences
- Sequences given by an nth-term formula
- Simple recurrences of the form x_{n+1}=f(x_n)
153 TMUA practice questions tagged to syllabus MM2, each with a worked solution. Here is what the topic tests, how hard it gets and where marks go.
One card per syllabus point, with the questions we hold for it.
Live counts from the FrontierVUE question bank.
Most questions are medium: 47% of the 153.
Official paper, recalled version
Tap a card for the full explanation.
Topic practice pulls MM2 questions only, timed, with worked solutions. The 2023 Paper 1 and Paper 2 are free to try.
TMUA sequences and series (MM2)
The strands the syllabus sets out under this topic
Tap a branch to unfold
139
Questions catalogued against this topic by FrontierVUE
71
Times those catalogued questions appear on FrontierVUE mock papers
4
Syllabus points under this topic in the FrontierVUE catalogue
| Questions in the FrontierVUE catalogue | |
|---|---|
| 2016 | 5 |
| 2017 | 7 |
| 2018 | 6 |
| 2019 | 5 |
| 2020 | 4 |
| 2021 | 3 |
| 2022 | 4 |
| 2023 | 5 |
Counts are of past paper questions catalogued and tagged to MM2 by FrontierVUE, grouped by the year of the paper they come from; this is a platform tagging measure, not official paper-level data. 2017 is the fullest year at 7 and 2021 the thinnest at 3, and no year between 2016 and 2023 is empty. This is a standing feature of the test, not a corner you can gamble on skipping.
By syllabus section
UAT-UK, Pearson, OCR, the University of Cambridge, Imperial College London and other names and logos belong to their respective owners.