Find the smallest positive integer n such that n ! has 290 trailing zeroes.
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.
I never thought of evaluating the infinite limit of that sum. At least it gives a more reasonable and close approximation quicker. Thanks for sharing!
Can somebody please explain a little why this approach is working?
Same method! Although in the first step I miscalculated it as 1060 so it took me time.
We will have to evaluate the range of possible value of n , using i = 1 ∑ ⌊ l o g 5 n ⌋ ⌊ 5 i n ⌋ For n = 1 1 0 0 , these sum will be 2 2 0 + 4 4 + 8 + 1 = 2 7 3 and for n = 1 2 0 0 , these sum will be 2 4 0 + 4 8 + 9 + 1 = 2 9 8 . Given we need n ! with at least 290 trailing zeros, we can conclude that 1 1 0 0 < n < 1 2 0 0 . When we shift n = 1 1 5 0 , the sum will be 2 3 0 + 4 6 + 9 + 1 = 2 8 6 . From here, every increment of 5 will add one more zero. We then add four 5s (=20), then we will get the sum of 2 3 4 + 4 6 + 9 + 1 = 2 9 0 , satisfying the requirement, hence, n = 1 1 7 0
Problem Loading...
Note Loading...
Set Loading...
2 9 0 = ⌊ 5 n ⌋ + ⌊ 5 2 n ⌋ + ⌊ 5 3 n ⌋ + …
2 9 0 = 1 − 5 1 5 n
2 9 0 = 4 n ⇒ n = 1 1 6 0
Now we can see that number of zeroes in 1 1 6 0 ! = 2 8 8 .
Therefore to get two more zeroes (i.e. 2 9 0 zeroes) the answer must be 1 1 7 0 .