Browse · MATH
Printjmc
number theory intermediate
Problem
For , let denote the th Fibonacci number (that is, , and for all ). What is the greatest possible value of the greatest common divisor of two consecutive Fibonacci numbers?
Solution
We want to find the maximum possible value of . Since by the Euclidean algorithm, this is equivalent to finding It follows that
Final answer
1