Recurrence Relations
Define sequences by earlier terms.
Key idea
Define sequences by earlier terms.
In depth
A recurrence defines each term from earlier ones: aₙ = f(aₙ₋₁, ...). With initial values, it determines the whole sequence. They model growth, algorithms and counting.
Worked example
aₙ = 2aₙ₋₁ + 1, a₀ = 0 gives 0, 1, 3, 7, 15, ... = 2ⁿ − 1.
Formula
Real-world uses
- Modelling savings that grow each year, population rules and the running time of recursive code
Common mistake
Forgetting the initial conditions.
How to learn this
- Read the key idea and say it in your own words.
- Work through the worked example, then try a similar problem.
- Use the interactive lesson’s visual and mini-quiz to check the pattern.
Frequently asked questions
What is Recurrence Relations?
Define sequences by earlier terms. It is a topic at the advanced level in Discrete Math & Number Theory.
What is the formula for Recurrence Relations?
The key formula is aₙ = aₙ₋₁ + aₙ₋₂.
Where is Recurrence Relations used in real life?
Real-world examples: Modelling savings that grow each year, population rules and the running time of recursive code.
What should I learn before Recurrence Relations?
Make sure you are comfortable with Generating Functions, the previous topic in Discrete Math & Number Theory.
What is a common mistake with Recurrence Relations?
Forgetting the initial conditions.
How can I practise Recurrence Relations?
Open the interactive lesson, play with the visual, then answer the three-question mini-quiz. Getting two right marks the topic complete.
What comes after Recurrence Relations?
Move on to Solving Linear Recurrences next.
Related advanced topics in Discrete Math & Number Theory
- Tautologies and Contradictions – Always true or always false statements.
- Logical Equivalence – Statements with identical truth tables.
- De Morgan’s Laws – Negation swaps AND and OR.
- Converse and Contrapositive – A conditional equals its contrapositive.
- Quantifiers – “For all” and “there exists”.
- Negating Quantified Statements – Flip the quantifier and negate the predicate.