The Fibonacci sequence goes F(0)=0, F(1)=1, and for n>1, F(n)=F(n1)+F(n2).
Show that for every positive integer m there exists an integer n>0 such that m divides F(n).
(In reply to
re(2): ProofQuick fix by Nick Hobson)
Did you realize how your question was solved?

Posted by armando
on 20050613 12:53:45 