0 . 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 2 0 0 0 0 3 0 0 0 0 5 0 0 0 0 8 0 0 0 1 3 0 0 0 2 1 0 0 0 3 4 0 0 0 5 5 0 0 0 8 9 0 0 1 4 4 …
The above shows the first few digits (actually 65) of the decimal representation of the fraction 9 , 9 9 9 , 8 9 9 , 9 9 9 1 . If we split the digits into partitions of 5, we can see that the numbers form a Fibonacci sequence: 0 , 1 , 1 , 2 , 3 , 5 , 8 , 1 3 , … . How many positive Fibonacci numbers can we find before the pattern breaks off?
Note: For example, suppose that the fraction equals 0 . 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 2 0 0 0 0 3 0 0 0 0 9 … instead of the one given at the top. Then you could only find the first five Fibonacci numbers, namely 0 , 1 , 1 , 2 , 3 . So your answer would then be that there are 4 positive Fibonacci numbers before the pattern breaks off.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
As a separate example, look at the smaller root of 1 0 0 0 0 0 0 x 2 − 1 0 0 0 0 0 0 x + 1 Notice anything unusual?
Log in to reply
WHAAAAAAAAAAAAAAAAAAT?! How's that possible? Let me get my thinking cap on.
Log in to reply
Catalan??? No! It can't be.
Log in to reply
@Pi Han Goh – Yup, I see it now. A generating function by (this one is left as an exercise for the reader)! Nice One Daniel!
Log in to reply
@Pi Han Goh – Added the last line in my problem statement! ^_^
I cant observe anything . Please tell me what is there.
Log in to reply
Check the solutions to the problem here: https://brilliant.org/problems/is-this-a-coincidence-too/
@Pi Han Goh This problem has led to too many coincidence problems on brilliant. Interesting!
Problem Loading...
Note Loading...
Set Loading...
Let F ( x ) = 1 − x − x 2 x . Then 1 0 0 0 0 0 1 F ( 1 0 0 0 0 0 1 ) = 9 9 9 9 8 9 9 9 9 9 1
But note that F ( x ) is the generating function of the Fibonacci numbers, so F ( x ) = x + x 2 + 2 x 3 + 3 x 4 + 5 x 5 + ⋯ So 9 9 9 9 8 9 9 9 9 9 1 = 1 0 0 0 0 0 1 F ( 1 0 0 0 0 0 1 ) = 0 . 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 2 ⋯ and so on, generating all the Fibonacci numbers to infinity. At least, that would be the case if there wasn't a finite amount of space for the Fibonacci numbers: the fact that we used x = 1 0 0 0 0 0 1 means that there is only five digits of space for each Fibonacci number. We find that the first Fibonacci number with six digits is F 2 6 = 1 2 1 3 9 3 which will bring a carry to F 2 5 , making it one more than the actual Fibonacci number. Since F 2 5 < 9 9 9 9 9 , we are sure that there are no carries, so F 2 4 is the last Fibonacci number in the pattern.
Thus, the answer is 2 4 .