- Home
- Courses
- AQA A-Level Maths
- Sequences and Series
- Recurrence Relations
Recurrence Relations
A recurrence relation defines each term from the one before, rather than from its position. It is how sequences are often generated in real life — this month’s value depends on last month’s — and it introduces periodic and convergent behaviour.
The big picture
There are two ways to describe a sequence. A rule (like ) lets you jump straight to any term. A (or term-to-term rule) instead says how to get the next term from the current one, such as . The recurrence view matches how change actually accumulates — savings that grow by a percentage each year, a drug clearing from the body each dose, a population changing each generation. Learning to generate terms, and to classify a sequence as increasing, decreasing, periodic or convergent, is what turns this from notation into a modelling tool.
What you'll be able to do
- Distinguish position-to-term from term-to-term (recurrence) definitions
- Generate terms from a recurrence relation and a starting value
- Recognise periodic, increasing, decreasing and convergent sequences
- Interpret a recurrence in a modelling context
Two ways to define a sequence
A rule gives directly in terms of : put in the position, get the term. A gives in terms of : it tells you how to step from one term to the next, and needs a starting value to get going.
For example with generates — the same sequence a position rule describes, but built step by step.
Example 1A sequence has with . Find the first four terms.
Tip — Keep and straight: is the term you have, is the one you are computing. Muddling them is the main pitfall.
Describing long-term behaviour
Once a sequence is generated, you describe how it behaves. It may be (each term larger), (each smaller), (the terms cycle and repeat with a fixed period), or (the terms settle towards a limit).
A periodic sequence is worth spotting: with gives — period 2. In such cases you can find far-off terms by using the cycle rather than computing every step.
A sequence approaches a where the term stops changing: . Setting and solving is exactly how you find the value an iterative process settles on — the seed of the Numerical Methods chapter.
Recurrences as models
Recurrence relations shine in modelling, because “next depends on now” is how most real processes work. A savings account with interest, a course of medication, or a fish population each naturally give a recurrence, and summing the terms answers questions like “total taken after 10 doses”.
Example 1A patient takes 10 mg of a drug daily. Each day 20% of the drug present is cleared before the next dose. Write a recurrence for the amount just after the -th dose.
Think like an examiner
- Track the subscripts carefully: substitute the current term to produce , one step at a time.
- For a periodic sequence, state the period and use the cycle to find distant terms rather than iterating dozens of times.
- To find a limit of a convergent sequence, set and solve the resulting equation.
- In modelling questions, define your variable clearly (what represents and when it is measured) before writing the recurrence.
Common misconceptions
Recurrence essentials
Stretch yourself
A sequence is defined by with . Show that it converges, and find its limit.
Hint — Generate a few terms to see the trend, then set and solve for the limit.
Reveal solution
Questions students ask
What is a recurrence relation?
How is it different from a position-to-term formula?
What is a periodic sequence?
How do I find the limit of a convergent sequence?
Key takeaways
- A recurrence defines from and needs a starting value.
- Position-to-term rules jump to any term; recurrences build the sequence in order.
- Sequences may be increasing, decreasing, periodic or convergent.
- A limit satisfies — the fixed-point idea.
- Recurrences model real “next depends on now” processes.
How this fits the course
Test yourself
Answer a few questions, then review anything you missed.
Prefer paper? Open the written self-check
Answer each question before opening its answer. This self-check does not record a quiz score.
For , , the third term is:
Show answer and explanation
Answer:
, .
A recurrence relation defines each term from:
- the previous term
- its position
- the sum of all terms
- the common ratio
Show answer and explanation
Answer: the previous term
It is a term-to-term rule.
For , , the value of is:
Show answer and explanation
Answer:
.
The sequence is:
- periodic (period 2)
- convergent
- increasing
- arithmetic
Show answer and explanation
Answer: periodic (period 2)
It cycles between two values every two terms.
For a convergent sequence, the limit satisfies:
Show answer and explanation
Answer:
At the limit the term stops changing, so .
The limit of (convergent) is:
Show answer and explanation
Answer:
.
Keep practising
Start with the quiz above to check the key ideas. You can also choose another topic from the practice library.
Related lessons
All 8 lessons- Same chapterArithmetic Sequences and Seriesnth term, and the sum of an arithmetic series (Gauss’s pairing).
- Same chapterGeometric Sequences and SeriesCommon ratio, sums, and the sum to infinity.
- Same chapterSigma NotationReading and evaluating Σ notation.
Put the methods into practice: see how A-Level maths duels work. An account is required to play; the overview and sample are public.