Recurrence Relations (OCR A Level Maths: Pure)

Revision Note

Roger

Author

Roger

Last updated

Did this video help you?

Recurrence Relations

What do I need to know about recurrence relations?

  • A recurrence relation describes each term in a sequence as a function of the previous term – ie un+1 = f(un)
  • Along with the first term of the sequence, this allows you to generate the sequence term by term

 Recur Rel Illustr 1, A Level & AS Level Pure Maths Revision Notes

 

  • Both arithmetic sequences and geometric sequences can be defined using recurrence relations
    • Arithmetic can be defined by u subscript n plus 1 end subscript equals u subscript n plus d comma space u subscript 1 equals a
    • Geometric can be defined by u subscript n plus 1 end subscript equals u subscript n cross times r comma space u subscript 1 equals a

Recur Rel Illustr 2, A Level & AS Level Pure Maths Revision Notes

 

  • However, you can also define sequences that are neither arithmetic nor geometric

 Recur Rel Illustr 3, A Level & AS Level Pure Maths Revision Notes

Examiner Tip

  • For arithmetic or geometric sequences defined by recurrence relations, you can sum the terms using the arithmetic series and geometric series formulae.
  • To sum up the terms of other sequences, you may have to think about the series and find a clever trick.

Worked example

Recur Rel Example, A Level & AS Level Pure Maths Revision Notes

You've read 0 of your 10 free revision notes

Unlock more, it's free!

Join the 100,000+ Students that ❤️ Save My Exams

the (exam) results speak for themselves:

Did this page help you?

Roger

Author: Roger

Expertise: Maths

Roger's teaching experience stretches all the way back to 1992, and in that time he has taught students at all levels between Year 7 and university undergraduate. Having conducted and published postgraduate research into the mathematical theory behind quantum computing, he is more than confident in dealing with mathematics at any level the exam boards might throw at you.