Recurrence relations
What Recurrence relations means in Mathematics A-Level, as defined for AQA, Pearson Edexcel, WJEC.
Definitions of Recurrence relations
Exam boards and our study guides word this term in slightly different ways. Learn the version your board uses.
Check what you remember
Read the wording for your board, then hide it and explain Recurrence relations in your own words. Rough notes are fine. This is a self-check, with no mark or grade.
Reference: Pearson Edexcel
Relations of the form xₙ₊₁ = g(xₙ) that generate successive approximations, converging when the iteration is stable near the root.
A first-order relation xₙ₊₁ = f(xₙ) alongside a given initial term x₁, from which subsequent terms are generated step-by-step.
Relations of the form x_{n+1}=g(x_n) used to solve equations approximately by iteration.
Topics that use Recurrence relations
- I: Numerical methods (AQA A-Level)
- Numerical methods (Pearson Edexcel A-Level)
- Sequences and Series (A2 Unit 3: Pure Mathematics B) (WJEC A-Level)
Related terms
- recurrence relation
- Trapezium rule
- Approximation and convergence
- Approximation and error
- Arithmetic sequence
- binomial approximation
- Bisection and interval narrowing
- change of sign
Using Recurrence relations in the exam
Check the command word and mark scheme for your exact question. After comparing your explanation with the reference, use the term in an answer on the linked topic. This practice does not predict an exam mark.
Practise Mathematics questions
Create a free account to answer exam-style questions on this topic and get feedback on your answers.
A week of Premium from your first lesson · Then the free plan continues · No card, no charge