Fibonacci 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

The 7th rightmost digit in 32 consecutive Fibonacci numbers are all 0's.

Let F n F_n be the smallest Fibonacci number that can be the first of such a sequence of 32 Fibonacci numbers. Find n n .

Note : F 0 = 0 , F 1 = F 2 = 1 F_0 = 0, F_1 = F_2 = 1 .

Inspiration .


The answer is 14999999.

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

Michael Mendrin
Jul 27, 2015

(The foregoing is given without proof regarding the properties of the Pisano period function, usually denoted as π ( n ) \pi \left( n \right) , where n n is the base)

The sequence of the last digit of Fibonacci numbers repeats with a period of 60 60 , so in base 10 10 , we have π ( 10 ) = 60 \pi \left( 10 \right) =60 . In other bases n = 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , n=1,2,3,4,5,6,7,8,9,10,… we have

1 , 3 , 8 , 6 , 20 , 24 , 16 , 12 , 24 , 60 , 1,3,8,6,20,24,16,12,24,60,…

One property of the Pisano period function is

π ( p a ) = p a 1 π ( p ) \pi \left( { p }^{ a } \right) ={ p }^{ a-1 }\pi \left( p \right)

where p p is a prime number, and a a is any integer

Another property of same is, for primes p 1 , p 2 , p 3 , . . . { p }_{ 1 },{ p }_{ 2 },{ p }_{ 3 },...

π ( p 1 a p 2 b p 3 c . . . ) = \pi \left( { { { { p }_{ 1 } }^{ a }{ { p }_{ 2 } }^{ b }{ { p }_{ 3 } }^{ c }... } } \right) =

L C M ( π ( p 1 a ) , π ( p 2 b ) , π ( p 3 c ) , . . . ) LCM\left( \pi \left( { { p }_{ 1 } }^{ a } \right) ,\pi \left( { { p }_{ 2 } }^{ b } \right) ,\pi \left( { { p }_{ 3 } }^{ c } \right) ,...\quad \right)

Hence, for n = 10 7 = 2 7 5 7 n={ 10 }^{ 7 }={ 2 }^{ 7 }{ 5 }^{ 7 } , we have

π ( 10 7 ) = L C M ( 2 6 π ( 2 ) , 5 6 π ( 5 ) ) = L C M ( 2 6 3 , 5 6 20 ) = 15000000 \pi \left( { 10 }^{ 7 } \right) =LCM\left( { 2 }^{ 6 }\pi \left( 2 \right) ,{ 5 }^{ 6 }\pi \left( 5 \right) \right) =LCM\left( { 2 }^{ 6 }3,{ 5 }^{ 6 }20 \right) =15000000

Now, consider the Fibonacci series from F 1 { F }_{ -1 } to F 30 { F }_{ 30 }

1 , 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 2 , 34 , 55 , 89 , 144 , 233 , 377 , 610 , 987 , 1597 , 1,0,1,1,2,3,5,8,13,2,34, 55, 89, 144, 233, 377, 610, 987, 1597,
2584 , 4181 , 6765 , 10946 , 17711 , 28657 , 46368 , 75025 , 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025,
121393 , 196418 , 317811 , 514229 , 832040 121393, 196418, 317811, 514229, 832040

after which the terms are greater than 6 6 digits in length. This sequence will repeat at

F 15000000 1 = F 14999999 { F }_{ 15000000-1 }={ F }_{ 14999999 }

so that the answer is 14999999 14999999

Note that in order for this sequence of 32 32 numbers to repeat exactly, the 7 t h 7th digit (and others not shown) must be 0 0 , making for a sequence of 32 32 consecutive 0 s 0s in the 7 t h 7th 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.

But how do you know that no such sequence exists between F 33 F_{33} to F 14999999 F_{14999999} ?

Julian Poon - 5 years, 8 months ago

Log in to reply

Let's try looking at this in another way. Can you devise a sequence of 32 7-digit numbers (with the 7th digit always being 0) that obey the additive property of Fibonacci numbers, but does not start with 0000001, followed by 0000000?

Michael Mendrin - 5 years, 8 months ago

Log in to reply

Ah yes. Thanks, I got it!

Julian Poon - 5 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...