All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Fibonaccian nines (Posted on 2004-06-15) Difficulty: 3 of 5
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.)
Some Thoughts Some thoughts... | Comment 2 of 7 |

I'm guessing the proof lies somewhere within the realm of proving strings of numbers within an infinite set of numbers displaying a random distribution of digits will have a given pattern somewhere.

I'm not sure how you would prove that numbers in the Fibonacci sequence have a random distribution of digits, though.


  Posted by Erik O. on 2004-06-15 14:40:37
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 (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information