Prove By Induction (Fibonacci Sequence)

172 Views Asked by At

Prove by PMI $\gcd(f_n,f_{n+1}) = 1$ for all natural numbers $n$. $f_n$ represents the Fibonacci sequence.

2

There are 2 best solutions below

3
On

Hint: $\gcd(a,b)=\gcd(a-b,b)$.

1
On

Three consecutive terms in a Fibonacci sequence can be written as $a,b,a+b$. If $d$ divides $b$ and $d$ divides $a+b$, then $d$ divides $a+b-b=a$.