## Related questions with answers

The Fibonacci sequence is defined recursively as follows: $f_0=0, f_1=1, f_{f}=f_{(f−1)}+f_{(f−2)}$ for all integers $f$ with $f\ge 2$. The first few terms are $0, 1, 1, 2, 3, 5, 8, 13$. Prove that

$f_f= \frac{1}{\sqrt{5}}\left(\left(\frac{1+\sqrt{5}}{2}\right)^{n}-\left(\frac{1-\sqrt{5}}{2}\right)^{n}\right)$

for every non-negative integer $f$.

Solution

VerifiedLet us denote

$\phi=\dfrac{\sqrt{5}+1}2$

Then we have

$\phi^{-1} =\dfrac 1\phi= \dfrac{\sqrt{5}-1}2$

Thus we have prove the statement $P_n$.

- For all positive integer $n\geq 2$, $F_n = \frac 1{\sqrt{5}}\left[\phi^n-(-\frac 1\phi)^n \right]$

**Base Case:** First note that

$1+\frac 1\phi=\phi$

This gives

$\begin{aligned} \frac 1{\sqrt{5}}\left[\phi^2-(-\frac 1\phi)^2 \right] &= \frac 1{\sqrt{5}}\left[\phi^2- (1-\phi)^2 \right]\\ & =\frac{1}{\sqrt 5}\left( 2\phi-1\right)\\ &= \frac{1}{\sqrt 5} \big((1+\sqrt 5)-1\big)\\ &=1\\ &=F_2 \end{aligned}$

Thus $P_2$ is true.

## Create an account to view solutions

## Create an account to view solutions

## Recommended textbook solutions

#### Computer Organization and Design MIPS Edition: The Hardware/Software Interface

5th Edition•ISBN: 9780124077263David A. Patterson, John L. Hennessy#### Fundamentals of Database Systems

7th Edition•ISBN: 9780133970777 (1 more)Ramez Elmasri, Shamkant B. Navathe#### Introduction to Algorithms

3rd Edition•ISBN: 9780262033848 (5 more)Charles E. Leiserson, Clifford Stein, Ronald L. Rivest, Thomas H. Cormen#### Introduction to the Theory of Computation

3rd Edition•ISBN: 9781133187790 (2 more)Michael Sipser## More related questions

1/4

1/7