The Fibonacci numbers F0, F1,... are given by the recurrence Fn+1 = Fn + Fn−1, F0 = 0, F1 = 1. Show that for any n ≥ 1, gcd(Fn+1, Fn) = 1.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.