Prove:
The GCD (greatest common divisor) of any two Fibonacci numbers: is also a Fibonacci number!
Derive:
A formula for GCD(f_m, f_n).
What is the GCD(f₆, f₂₁)?

(In reply to a table by Charlie)

While working on the Prime Fibonacci Numbers, I came across the Wikipedia article on that topic, but which also included GCD(F(m),F(n)) = F(GCD(m,n)), which agrees with a spot check of the posted table. So GCD(F(6),F(21)) = F(3) = 2.

Edited on May 3, 2013, 2:41 pm

Posted by Charlie on 2013-05-03 14:38:22