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
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
The Euclidean algorithm, $\gcd(a,b)=\gcd(a-b,b)$ works well with the Fibonacci recurrence.