The 7th rightmost digit in 32 consecutive Fibonacci numbers are all 0's.
Let be the smallest Fibonacci number that can be the first of such a sequence of 32 Fibonacci numbers. Find .
Note : .
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.
(The foregoing is given without proof regarding the properties of the Pisano period function, usually denoted as π ( n ) , where n is the base)
The sequence of the last digit of Fibonacci numbers repeats with a period of 6 0 , so in base 1 0 , we have π ( 1 0 ) = 6 0 . In other bases n = 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 1 0 , … we have
1 , 3 , 8 , 6 , 2 0 , 2 4 , 1 6 , 1 2 , 2 4 , 6 0 , …
One property of the Pisano period function is
π ( p a ) = p a − 1 π ( p )
where p is a prime number, and a is any integer
Another property of same is, for primes p 1 , p 2 , p 3 , . . .
π ( p 1 a p 2 b p 3 c . . . ) =
L C M ( π ( p 1 a ) , π ( p 2 b ) , π ( p 3 c ) , . . . )
Hence, for n = 1 0 7 = 2 7 5 7 , we have
π ( 1 0 7 ) = L C M ( 2 6 π ( 2 ) , 5 6 π ( 5 ) ) = L C M ( 2 6 3 , 5 6 2 0 ) = 1 5 0 0 0 0 0 0
Now, consider the Fibonacci series from F − 1 to F 3 0
1 , 0 , 1 , 1 , 2 , 3 , 5 , 8 , 1 3 , 2 , 3 4 , 5 5 , 8 9 , 1 4 4 , 2 3 3 , 3 7 7 , 6 1 0 , 9 8 7 , 1 5 9 7 ,
2 5 8 4 , 4 1 8 1 , 6 7 6 5 , 1 0 9 4 6 , 1 7 7 1 1 , 2 8 6 5 7 , 4 6 3 6 8 , 7 5 0 2 5 ,
1 2 1 3 9 3 , 1 9 6 4 1 8 , 3 1 7 8 1 1 , 5 1 4 2 2 9 , 8 3 2 0 4 0
after which the terms are greater than 6 digits in length. This sequence will repeat at
F 1 5 0 0 0 0 0 0 − 1 = F 1 4 9 9 9 9 9 9
so that the answer is 1 4 9 9 9 9 9 9
Note that in order for this sequence of 3 2 numbers to repeat exactly, the 7 t h digit (and others not shown) must be 0 , making for a sequence of 3 2 consecutive 0 s in the 7 t h digit.
Also note that the Pisano period function, with its properties, applies to many other additive number sequences, such as Lucas numbers, so it's an useful function to be familiar with, one with interesting properties.