Prove that there exists a fibbonaci number with 2007 zeros at the end.
Welcome to Math Help Forum - Click here to Register
Welcome to the largest Math Help Forum, a free community dedicated to math help and math discussions.
We welcome everyone and the community is free to join so register today and become part of our math family!
Surprised no one answered this. Basically the sequence is periodic for mod 10^k. I'm not great at "mathematical" proofs but I'll try to explain why the
81654467027036406333526832763551927773679097587863 01828103274902654645800068375700423192578874801138 49896633172886417559644153347373906530476511639799 03470572826662271659037360447273031780400848575549 03508099075491216597278597834450044376476326281932 72152447517016200655258545132287805391608994236702 32370210418870367835844101551100928971591752027793 74607868568852438352189365382779980690816983216280 47397573781719260414198780609712500413245349971425 87004390684924423594258925625019876096653599085609 00833537023852992689698182781120930012927796187150 19307793377582295367811015065238563352113043140314 90944085671313823277974734958981557281292085601890 06744176078944577779348337171652625983474768859811 57299089487587648844548714667589147775120730050057 94136877675483582484025033771770603207595920161761 00860244176010390835538357799347775384097791851502 58580435803764905167388254314601808367655065706903 17145676009101910237591110135982587999542354257337 69865643686884677779609681580181367794399263876437 47119348248768178379895525253396714698402834275124 89595937485206340807420157549668224663572188043588 91996801563311872885991207304462688534842842899765 28900852819220986366298798374162295530625566277432 64488853168463514650779309887611114310442114751605 26624148697040922363425273844106276196773808206444 55020825499976294193040707383269299795703071190607 99176489670245238094992146216100081801414489746093 7501st term
is the one you're looking for.
(starting n = 1 is 0, n = 2 is 1, n = 3 is 1, n = 4 is 2, n = 5 is 3, n = 6 is 5.... )
The entire Fibonacci series (F) is determined by two numbers (pairs), and F_n mod 10^k for those numbers also determines the sequence. Because there are a finite number of pairings for x mod 10^k, the sequence created by F_n mod 10^k is periodic.
The periodicity of the sequence F_n mod 10^k can be determined:
at k=1 it's 60, k=2 it's 300, and k=3 it's 1500.
The F_n term immediately following the end of the period in effect "restarts" the mod sequence at 0.
or in other words, the F_n term where n = m*12*5^k + 1 (where m is any positive integer) will always have k zeros. ( F_[m*12*5^k + 1] mod 10^k = 0 )
If someone wants to form an actual proof out of that I'd be interested. Note: There are other terms with k zeros at the end besides the (m*12*5^k + 1)th terms.
Also if any of this is unclear please let me know and I'll do my best.
Actually, wolfram alpha disagrees with me.
Their 37,500th term (n=1, F_n=1) only has 4 zeroes, and my thinking meant it ought to have had 5. Couldn't edit out the above but I'll add more info if I figure this out. I don't think I'm completely wrong.
Spoiler:
You want to find N such thatdivides the Nth Fibonacci number
, where n=2007.
I haven't tried to prove any of this, but a quick trawl through a table of Fibonacci numbers shows that (for values of N up to 300)divides
whenever N is a multiple of
, and
divides
whenever N is a multiple of
.
If you can prove that both of those observations hold in general, then it will follow thatdivides
when
. When n=2007, that is a large number even in comparison with those calculated by Stro. But in fact this approach is just a slight modification of the one proposed by Stro in his first comment.