This can't be a coincidence as well

Consider the decimal expansion of 1 / 998998999 1 / 998998999 :

0. 000 000 001 001 002 004 007 013 024 0. \quad 000 \quad 000 \quad 001 \quad 001 \quad 002 \\ \ \ \quad 004 \quad 007 \quad 013 \quad 024 \quad \ldots

Notice that those numbers in units of three digits - let's call them { a n } \lbrace a_{n} \rbrace - satisfy a n = a n 1 + a n 2 + a n 3 a_{n} = a_{n-1} + a_{n-2} + a_{n-3} .

If a 1 = a 2 = 1 a_{1} = a_{2} = 1 and a 3 = 2 a_{3} = 2 , find the least n n for which the recurrence is no longer satisfied.

Inspired by this problem .


The answer is 13.

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

Vishnu C
Jul 6, 2015

The series { a n } \{ a_n \} is nothing but the tribonacci series, and its generating function is given by: f ( z ) = z 1 z z 2 z 3 = n = 1 a n z n f(z) = \frac z {1-z-z^2-z^3} =\displaystyle \sum ^{\infty} _{n=1} {a_n \cdot z^n}

1/998998999 = f ( 1 1000 ) f(\frac 1 {1000}) = 0. 000 000 001 001 002 004 ....

The 13th tribonacci number = 927 and after that, you have 4 digit tribonacci numbers. But because there are only places for 3 digits, the carry of the next tribonacci (1705) gets added to the units of 927, making it 928. So, the sequence stops there at n=13.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...