Historical Context & Motivation
Long before modern computers, mathematicians needed a way to describe patterns where each value depends on the ones that came before it. A recurrence relation is exactly that kind of rule: instead of giving a direct formula for the nth term, you explain how to get the next term from the previous one. Think of it like a recipe that says "to make the next batch, take what you just made and add a little more." This seemingly simple idea turns out to be incredibly powerful for modelling real-world situations such as population dynamics, financial investments, and drug dosage levels in the body.
The central question that recurrence relations answer is: how can we predict the future state of a system when each new state depends on the current one? Whether you are tracking savings in a bank account or the number of fish in a lake, recurrence relations give you a structured way to step forward one period at a time.
Core Principles & Definitions
Before diving into calculations, you need to understand the building blocks of every recurrence relation. A recurrence relation has two essential ingredients: an initial condition (the starting value) and a recursive rule (the instruction that produces each subsequent term). Without both pieces, the sequence is not fully defined.
Initial Condition (u₁)
Recursive Rule (uₙ₊₁ = f(uₙ))
First-Order vs Higher-Order
Homogeneous vs Non-Homogeneous
Long-Run Behaviour
Visualising Recurrence Relations
The diagram below shows how a first-order linear recurrence relation uₙ₊₁ = 1.5uₙ − 4 generates a sequence starting from u₁ = 20. Each point on the graph represents one term, and the arrows illustrate the 'feed-forward' process: the output of one step becomes the input for the next.
Looking at the graph, you can see the characteristic shape of exponential growth. The gap between successive terms widens because each new term is 1.5 times the previous term, minus 4. In the IB, you will encounter recurrence relations where the multiplier r controls whether the sequence grows, shrinks, or oscillates, while the constant d shifts the entire sequence up or down.
Mathematical Framework
The IB syllabus focuses on first-order linear recurrence relations of the form shown below. Understanding the variables in this equation is the foundation for every modelling problem you will face.
When d = 0, this simplifies to uₙ₊₁ = r × uₙ, which is a geometric sequence. When r = 1, it becomes uₙ₊₁ = uₙ + d, which is an arithmetic sequence. So arithmetic and geometric sequences are actually special cases of the general linear recurrence.
Long-Run Behaviour & Classification
The value of the multiplier r completely determines the long-run behaviour of the sequence. The diagram below classifies the four main cases you need to know. Understanding these cases will help you interpret real-world models and predict whether a system is stable or unstable.
| Value of r | Behaviour | Steady State Exists? | Real-World Example |
|---|---|---|---|
| 0 < r < 1 | Monotonic convergence | Yes: L = d / (1 − r) | Drug concentration after repeated doses |
| r = 1 | Arithmetic sequence (constant growth) | No (unless d = 0) | Fixed weekly deposits in savings |
| r > 1 | Monotonic divergence | No | Compound interest (principal grows) |
| −1 < r < 0 | Oscillating convergence | Yes: L = d / (1 − r) | Damped price corrections |
| r < −1 | Oscillating divergence | No | Unstable feedback loops |
Worked Example: Medication Dosage Model
A patient takes 200 mg of a medication every 24 hours. Each day, the body eliminates 40% of the drug present in the bloodstream. We want to model the amount of medication in the patient's body just after each dose and determine the long-run level.
Strengths, Limitations & Comparisons
Recurrence relations are a powerful modelling tool, but like any model they have their strengths and weaknesses. The table below compares the recursive approach with the explicit (closed-form) approach and highlights when each is most useful.
| Aspect | Recursive Form (uₙ₊₁ = ruₙ + d) | Closed-Form (uₙ = ...) |
|---|---|---|
| Ease of setup | Very easy — just describe what happens at each step | Requires algebraic derivation from the recurrence |
| Finding the 100th term | Must compute all 99 previous terms first | Plug n = 100 directly into the formula |
| Modelling intuition | Clearly shows the process: multiply, then add | Hides the step-by-step process behind algebra |
| GDC / technology | Spreadsheets and GDCs iterate easily | Useful for symbolic computation and graphing |
| Limitations | Assumes constant rate r and constant addition d | Only exists for linear recurrences; nonlinear relations have no simple closed form |
Connections to Advanced Theory
Recurrence relations are a gateway to several powerful areas of mathematics. At the HL level, you have focused on first-order linear relations, but the same ideas extend into university-level topics. The table below shows how the concepts you have learned connect to more advanced theory.
| IB Concept | Advanced Extension | Where You'll See It |
|---|---|---|
| uₙ₊₁ = ruₙ + d | Linear difference equations (any order) | University algebra, signal processing |
| Steady-state L = d/(1 − r) | Fixed-point theory and stability analysis | Dynamical systems, economics |
| Discrete step-by-step modelling | Differential equations (continuous analogue) | Physics, engineering, biology |
| Fibonacci-type (second order) | Characteristic equation method | Combinatorics, computer science |
If you continue to study mathematics, you will discover that recurrence relations are the discrete-time counterpart of differential equations. Where differential equations model continuous change (like the temperature of a cooling object at every instant), recurrence relations model change at fixed intervals (like temperature readings every minute). Both approaches share the same underlying concept: the future state of a system is determined by its current state plus some rule of change.
Practice Problems
Lesson Summary
A recurrence relation defines each term of a sequence using the previous term. The standard first-order linear form is uₙ₊₁ = r × uₙ + d, where r is the multiplier and d is the constant. When d = 0, you get a geometric sequence; when r = 1, you get an arithmetic sequence. The value of r determines the long-run behaviour: if |r| < 1, the sequence converges to a steady-state value L = d / (1 − r); if |r| ≥ 1, it diverges.
To find the steady-state value, set uₙ₊₁ = uₙ = L and solve for L—a technique frequently tested on IB exams. Modelling with recurrence relations involves identifying the multiplier r (often a retention or growth rate), the constant d (a regular addition like a deposit or dose), and the initial condition u₁. These models are ideal for discrete processes such as annual interest, daily medication, and seasonal population changes. The closed-form solution uₙ = rⁿ⁻¹(u₁ − L) + L allows you to jump directly to any term without iterating through every previous one.