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: ( You must be logged in to post comments.)

Subject	Author	Date
No Subject	Drew Binsky	2023-06-13 20:28:40
great	davis john	2023-04-15 04:13:43
Problem Thoughts	K Sengupta	2021-12-19 11:21:26
Problem Solution	K Sengupta	2007-05-28 12:04:00
what is this puzzle	Mohammad	2004-07-17 23:58:35
re: Solution .....VERY PLEASED	Ady TZIDON	2004-06-15 18:17:30
Solution	Nick Hobson	2004-06-15 15:36:20
patterns?	Tristan	2004-06-15 14:58:27
Some thoughts...	Erik O.	2004-06-15 14:40:37
unsatisfying computer proof	Charlie	2004-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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info