+0  
 
0
46
1
avatar

For \(n \ge 0\), let \(F_n\) denote the \(n\)th Fibonacci number (that is, \(F_0 = 0, F_1 = 1\), and \(F_n = F_{n-1} + F_{n-2}\) for all \(n \ge 2\)). What is the greatest possible value of the greatest common divisor of two consecutive Fibonacci numbers?

 Oct 27, 2020
 #1
avatar
0

What is the greatest possible value of the greatest common divisor of two consecutive Fibonacci numbers?

 

GCD of two consecutive Fibonacci numbers, ALWAYS = 1

 Oct 27, 2020

20 Online Users