Topic module

Recurrence Relations and Limits

Translate repeated change into a recurrence relation, generate terms and solve and interpret the limiting equation.

Long-form learning
Concept to Risk to Memory to Check-up

How to study Higher Mathematics

Practise a skill without a calculator first, connect it to neighbouring techniques, then apply it in unfamiliar contexts with complete working and interpretation.

Core concepts

Concept 1

recurrence rule

Exam cue: What operation takes one term to the next?

Concept 2

initial term

Exam cue: Is the starting term stated with the correct index?

Concept 3

term generation

Exam cue: Why does a finite limit exist?

Concept 4

convergence condition

Concept 5

limit interpretation

Risk pitfalls and guardrails

Using the wrong initial term

Guardrail: Check signs, brackets, domain restrictions, units and whether the answer needs justification.

Solving L = aL + b without justifying convergence

Guardrail: Check signs, brackets, domain restrictions, units and whether the answer needs justification.

Confusing the limit with a term reached exactly

Guardrail: Check signs, brackets, domain restrictions, units and whether the answer needs justification.

Memory anchors

Rule plus start

A recurrence model needs both the update rule and an initial value.

Next from current

Apply the rule to uₙ to generate uₙ₊₁.

At the limit, next equals current

Set L equal to the recurrence expression in L.

Convergence needs |multiplier| < 1

For uₙ₊₁ = auₙ + b, this condition supports a finite limit.

Limit is approached

The sequence need not reach L in a finite number of steps.

Interpret the stable value

State what L represents in the original situation.

Checkpoint rule

Do the check-up only after you can summarize each concept in one sentence and identify one dangerous pitfall from memory.

Knowledge Check (after reading)

Short check-up to confirm understanding of this module.

Check-up Questions

1-2 question checkpoint

Given u₁=5 and u_(n+1)=2u_n+1, find u₂.

Given u₁=3 and u_(n+1)=u_n−4, find u₄.

Answer all questions to submit.

Next step personalized recommendations

What is Pass Harbor?

Completely free exam prep for 247 UK exams.

  • Practice questions
  • Flashcards
  • Study guides
  • Mock exams
  • No registration
  • No paywall
  • Start instantly
No more expensive exam prep. Quality study tools should be accessible to everyone.