1. Engineering
  2. Computer Science
  3. consider the infinite sequence of integers f0 f1 f2 ...

Question: consider the infinite sequence of integers f0 f1 f2 ...

Question details

Consider the infinite sequence of integers f0, f1, f2, ..., defined by f0 = 1, f1=2 and fn = fn-1 + fn-2  for all n \geq 2. Use induction on n to prove that fn > \left ( \frac{3}{2} \right )^{n} for all n \geq1.

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