perplexus.info :: Just Math : Fibonaccian nines

Fibonaccian nines (Posted on 2004-06-15)

Prove that in the Fibonacci sequence (0, 1, 1, 2, 3, 5, 8, 13, ... where each number is the sum of the two previous) there's at least one number that ends in 999999.

See The Solution Submitted by Federico Kereki

Rating: 4.3333 (3 votes)

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

Problem Solution

| Comment 7 of 10 |

Edited on October 26, 2012, 4:06 pm

Posted by K Sengupta on 2007-05-28 12:04:00

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

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