The Fibonacci sequence goes F(0)=0, F(1)=1, and for n>1, F(n)=F(n-1)+F(n-2).
Show that for every positive integer m there exists an integer n>0 such that m divides F(n).
(In reply to re(2): Proof--Quick fix
by Nick Hobson)
Did you realize how your question was solved?
Posted by armando
on 2005-06-13 12:53:45