Introduction0%

Recurrence Relations · Topic 1 of 5

Introduction

Video lesson

Theory

A recurrence relation is a type of recursive sequence which relies on knowing the previous term in order to obtain the next consecutive term.

i.e. if we wanted to know the 100th100^{th} term in a sequence, we would need to know the first 99 terms.

e.g. For the sequence 1, 5, 9, 13, ...

U0=1U_0 = 1 where U0U_0 is the initial term in the sequence.

Rule: add 4 to previous term

i.e. Un+1=Un+4U_{n+1} = U_n + 4

An example of a recurrence relation is gaining compound interest on money in a bank account.

You invest £100 in a bank account with an interest rate of 2%.

  • U0=100U_0 = 100
  • U1=102% of 100=1.02×100=102U_1 = 102\% \text{ of } 100 = 1.02 \times 100 = 102
  • U2=102% of 102=1.02×102=104.04U_2 = 102\% \text{ of } 102 = 1.02 \times 102 = 104.04
  • U3=102% of 104.04=1.02×104.04=106.12U_3 = 102\% \text{ of } 104.04 = 1.02 \times 104.04 = 106.12

i.e. Un+1=1.02Un, U0=100U_{n+1} = 1.02U_n, \ U_0 = 100 where UnU_n is the amount in the bank account after nn years.

⚠️ Common Examiner Traps

  • u0u_0 or u1u_1? read which term the sequence starts from. Being one term out runs through the entire rest of the question.
  • Each term depends on the one before: you cannot jump to the tenth term without generating the ones in between, unless a formula is given.
  • Keep full accuracy: rounding each term compounds the error quickly. Carry the decimals through.
  • Read the context carefully: "10% is removed" means multiplying by 0.9, not subtracting 10.