perplexus.info :: Numbers : Fibonacci Lore

Home > Numbers

Fibonacci Lore (Posted on 2005-06-10)

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).

See The Solution Submitted by McWorter

Rating: 4.0000 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

Clueless

| Comment 1 of 15

Wow! This is interesting, if true. I have no idea where to start. I'm looking forward to seeing the solution.

Posted by Steve Herman on 2005-06-11 12:21:05

Please log in:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info