Help me to prove that F(n) and F(m) are prime to each other.
, ,m is different from n (m!=n), they are integers and m>=0 , n>=0 . I know i have to prove that gcd(F(n),F(m))=1. I've been trying to prove for 2 days already and now i'm on the verge of giving up ... I'd be glad to see solution and explanation.