gcd(Fββ, Fββ) = Fβ
Need a hint?
The gcd of two Fibonacci numbers is the Fibonacci number whose index is the gcd of the indices.
gcd(Fββ, Fββ) = gcd(144, 2584) = 8 = Fβ, because gcd(12, 18) = 6.
How to work it out
The Fibonacci numbers are 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, β¦ so and .
Euclid's algorithm on the numbers: , , , so the gcd is 8, which is .
(1)The general reason: lets Euclid's algorithm on the numbers follow Euclid's algorithm on the indices.
LaTeX source of the formulas on this page
\[ 8=F_6 \]
\[ \gcd(144,2584)=8=F_6=F_{\gcd(12,18)} \]Questions
What is the answer to: gcd(Fββ, Fββ) = Fβ?
gcd(Fββ, Fββ) = gcd(144, 2584) = 8 = Fβ, because gcd(12, 18) = 6.
What is the key idea?
Fibonacci numbers inherit the divisibility structure of their indices.
Is there a hint?
The gcd of two Fibonacci numbers is the Fibonacci number whose index is the gcd of the indices.