Greatest Common Divisor with Fibonacci Numbers

537 Views Asked by At

Prove that for all integers $n\geq 0$:

$$\gcd(F_{n+1},F_n)=1$$

I am extremely lost. Please can some provide some hint or direction? Thank you so very much

1

There are 1 best solutions below

1
On BEST ANSWER

The Euclidean algorithm, $\gcd(a,b)=\gcd(a-b,b)$ works well with the Fibonacci recurrence.