Show that the Fibonacci numbers satisfy the recurrence
Chapter 10, Problem 28E(choose chapter or problem)
Problem 28E
Show that the Fibonacci numbers satisfy the recurrence relation fn = 5 fn-4 + 3 fn-5 for n = 5, 6. 7,..., together with the initial conditions f0 = 0. f1 = 1, f2 = 1, f3 = 2, and f4 = 3. Use this recurrence relation to show that f5n is divisible by 5, for n = 1, 2, 3,....
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer