All about
flooble

fun stuff

Get a free chatterbox

Free JavaScript

Avatars
perplexus
dot
info
Home
>
Just Math
Fibonaccian nines (
Posted on 20040615
)
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
Problem Solution
K Sengupta
20070528 12:04:00
what is this puzzle
Mohammad
20040717 23:58:35
re: Solution .....VERY PLEASED
Ady TZIDON
20040615 18:17:30
Solution
Nick Hobson
20040615 15:36:20
patterns?
Tristan
20040615 14:58:27
Some thoughts...
Erik O.
20040615 14:40:37
unsatisfying computer proof
Charlie
20040615 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 (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
blackjack
flooble's webmaster puzzle
Copyright © 2002  2016 by
Animus Pactum Consulting
. All rights reserved.
Privacy Information