The Fibonacci sequence
is defined recursively using the formulas a1=a2=1 and an+2=an+an+1 for all n≥1. Find the greatest common divisor of a484 and a2013.
It has been proven that
gcd(Fm,Fn) = Fgcd(m,n)
gcd(F484,F2013) = Fgcd(484,2013) = F11 = 89posted by Steve