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


Click to listen to the single ▶

Support album on Kickstarter
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: ( You must be logged in to post comments.)
  Subject Author Date
SolutionProblem SolutionK Sengupta2007-05-28 12:04:00
Some Thoughtswhat is this puzzleMohammad2004-07-17 23:58:35
re: Solution .....VERY PLEASEDAdy TZIDON2004-06-15 18:17:30
SolutionSolutionNick Hobson2004-06-15 15:36:20
Some Thoughtspatterns?Tristan2004-06-15 14:58:27
Some ThoughtsSome thoughts...Erik O.2004-06-15 14:40:37
Solutionunsatisfying computer proofCharlie2004-06-15 14:26:26
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 (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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