P
Initializing...
Fibonacci numbers form a strong divisibility sequence: gcd(F_m, F_n) = F_gcd(m,n) · Prove2Me