Question
The Fibonacci numbers $F_{0}, F_{1}, \ldots$ are given by the recurrence $F_{n+1}=F_{n}+F_{n-1}, F_{0}=0, F_{1}=1$ Show that for any $n \geq 1, \operatorname{gcd}\left(F_{n+1}, F_{n}\right)=1$
Step 1
We have $F_{n+1} = F_n + F_{n-1}$. Show more…
Show all steps
Your feedback will help us improve your experience
Nick Johnson and 78 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
The Fibonacci sequence $\left\{f_{n}\right\}$ is recursively defined by $f_{0}=f_{1}=1$ and $f_{n}=f_{n-1}+f_{n-2}$ for $n \geq 2 .$ Show that $$ \frac{1}{f_{n} f_{n+2}}=\frac{1}{f_{n} f_{n+1}}-\frac{1}{f_{n+1} f_{n+2}} $$ and use this formula to sum $\sum_{n=0}^{\infty} 1 /\left(f_{n} f_{n+2}\right)$.
Infinite Series
Series
$f_{n}$ is the $n$ th Fibonacci number. Show that $f_{0}-f_{1}+f_{2}-\cdots-f_{2 n-1}+f_{2 n}=f_{2 n-1}-1$ when $n$ is a positive integer.
Induction and Recursion
Recursive Definitions and Structural Induction
$f_{n}$ is the $n$ th Fibonacci number. Show that $f_{n+1} f_{n-1}-f_{n}^{2}=(-1)^{n}$ when $n$ is a positive integer.
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD