Denote by gcd(m,n) the greatest common divisor of numbers m,n, namely the largest possible d which divides both n and m. Prove for any m,n that gcd(Fn,Fm)=Fgcd(m,n).