1. Math
  2. Advanced Math
  3. the fibonacci sequence is recursively defined as f0 0...

Question: the fibonacci sequence is recursively defined as f0 0...

Question details

5. The Fibonacci sequence is recursively defined as fo 0, f1 1, and fn E fn-1 fn-2. The first few terms are 10, 1, 1, 2, 3, 5, 8, 13, 21, 34, (a) Let a fn 1/fn, for n 1. Write the first six terms of this sequence. Show that an-1 1 n-2 for n 2. (b) Assume that the sequence converges a (it does). Find its limit. Why was it necessary to assume the sequence converges? Be sure to report the eract answer using the Quadratic formula.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution