# Recurrence Relations: Fibonacci Numbers

Show that the Fibonacci numbers satisfy the recurrence relation f_n = 5f_n-4 + 3f_n-5 for n = 5, 6, 7,..., together with the initial f_0 = 0, f_1 = 1, f_2 = 1, f_3 = 2, and f_4 = 3.

See the attachment for the full question.

© BrainMass Inc. brainmass.com October 10, 2019, 5:48 am ad1c9bdddfhttps://brainmass.com/math/recurrence-relation/recurrence-relations-fibonacci-numbers-518647

#### Solution Summary

This problem demonstrates one particular recurrence relation that holds true for the so-called Fibonacci numbers; namely, Fn = 5Fn-4 + 3Fn-5.

$2.19