This can't be a coincidence

0. 00000 00001 00001 00002 00003 00005 00008 00013 00021 00034 00055 00089 00144 \begin{aligned} 0. && 00000 \quad 00001 \quad 00001 \quad 00002 \quad 00003 \quad 00005 \quad 00008 \\ && 00013 \quad 00021 \quad 00034 \quad 00055 \quad 00089\quad 00144\quad \ldots \\ \end{aligned}

The above shows the first few digits (actually 65) of the decimal representation of the fraction 1 9 , 999 , 899 , 999 . \large \frac1{9,999,899,999}. 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 , 13 , 0,1,1,2,3,5,8,13,\ldots . How many positive Fibonacci numbers can we find before the pattern breaks off?

Note: For example, suppose that the fraction equals 0.00000 00001 00001 00002 00003 00009 0.00000 \quad 00001 \quad 00001 \quad 00002 \quad 00003 \quad 00009 \ldots instead of the one given at the top. Then you could only find the first five Fibonacci numbers, namely 0 , 1 , 1 , 2 , 3 0,1,1,2,3 . So your answer would then be that there are 4 positive Fibonacci numbers before the pattern breaks off.



The answer is 24.

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.

1 solution

Daniel Liu
Jun 29, 2015

Let F ( x ) = x 1 x x 2 F(x)=\dfrac{x}{1-x-x^2} . Then 1 100000 F ( 1 100000 ) = 1 9999899999 \dfrac{1}{100000}F\left(\dfrac{1}{100000}\right)=\dfrac{1}{9999899999}

But note that F ( x ) 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 + F(x)=x+x^2+2x^3+3x^4+5x^5+\cdots So 1 9999899999 = 1 100000 F ( 1 100000 ) = 0.00000000010000100002 \dfrac{1}{9999899999}=\dfrac{1}{100000}F\left(\dfrac{1}{100000}\right)=0.00000 00001 00001 00002\cdots 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 100000 x=\dfrac{1}{100000} 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 26 = 121393 F_{26}=121393 which will bring a carry to F 25 F_{25} , making it one more than the actual Fibonacci number. Since F 25 < 99999 F_{25} < 99999 , we are sure that there are no carries, so F 24 F_{24} is the last Fibonacci number in the pattern.

Thus, the answer is 24 \boxed{24} .

As a separate example, look at the smaller root of 1000000 x 2 1000000 x + 1 1000000x^2-1000000x+1 Notice anything unusual?

Daniel Liu - 5 years, 11 months ago

Log in to reply

WHAAAAAAAAAAAAAAAAAAT?! How's that possible? Let me get my thinking cap on.

Pi Han Goh - 5 years, 11 months ago

Log in to reply

Catalan??? No! It can't be.

Pi Han Goh - 5 years, 11 months ago

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!

Pi Han Goh - 5 years, 11 months ago

Log in to reply

@Pi Han Goh Added the last line in my problem statement! ^_^

Pi Han Goh - 5 years, 11 months ago

I cant observe anything . Please tell me what is there.

Sahil Jain - 4 years, 3 months ago

Log in to reply

Check the solutions to the problem here: https://brilliant.org/problems/is-this-a-coincidence-too/

Daniel Liu - 4 years, 3 months ago

@Pi Han Goh This problem has led to too many coincidence problems on brilliant. Interesting!

Nihar Mahajan - 5 years, 11 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...