Fibonacci

Probability Level pending

Given: { f n = f n 1 + f n 2 , n 2 f 0 = 0 f 1 = 1 \begin{cases} f_{n} = f_{n-1}+f_{n-2}, & n\geq2 \\ f_{0}=0 \\ f_{1}=1 \end{cases}

f n f_{n} can be expressed in the following form:

f n = 1 a ( 1 + a b ) n 1 a ( 1 a b ) n for n 0 f_{n} = \frac {1}{a} \left ( \frac{1+a}{b} \right )^{n} - \frac {1}{a} \left ( \frac {1-a}{b} \right )^{n} \text{ for }n\geq0

Find a + b a+b to three decimal places.


The answer is 4.236.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...