Fib 性质 Gcd(f[n],f[m]) = f(gcd(n,m))

a) gcd(f_n, f_n-1) = 1, for all n 

b) f_m+n = f_m+1 f_n + f_m f_n-1 
c) if m divides n, then f_m divides f_n 
and the ever important Euclidean Algorithm which states: 

if n=qm+r, then gcd(n,m)=gcd(m,r). For such n,m we have

gcd(f_m,f_n) = gcd(f_m,f_qm+r) = gcd(f_m,f_qm+1f_r+f_qmf_r-1) = gcd(f_m,f_qm+1f_r) = gcd(f_m,f_r)

gcd(f_n,f_m)=gcd(f_m,f_r)

性质a,更相减损法即可证。

性质b,展开即显然。

由性质b和性质a，即可证得gcd(f_m,f_n) = f_gcd(m,n).