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

No Subject

Comment 10 of 10 |

The concept of periodicity can be used to demonstrate My Singing Monsters that there is at least one Fibonacci number that ends in 999999.

Posted by Drew Binsky on 2023-06-13 20:28:40

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