Skip to content

The most famous recursive sequence is probably the Fibonacci sequence:

f1=1f2=1fn+1=fn+fn−1
  1. Work out f3,f4,f5 and f6

  2. Define a new sequence gn by

    g1=1gn+1=1+1gn

    Find g2,g3,g4 and g5

  3. What is the relationship between these two sequences? Can you explain why?


To get started with (a), let n=1 to get f3=f2+f1.

Then let n=2 to get f4=f3+f2.

Keep going until you get to f6.