Find the smallest number such that has trailing zeroes . Given that all numbers are written in base 10.
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.
Since the factors 5 and 2 are needed to make a trailing zero, we can take the floor function of how many times the powers of 5 divide n (since they are less common than powers of 2):
2 5 0 0 0 0 0 0 0 = i = 1 ∑ ⌊ l o g 5 n ⌋ ⌊ 5 i n ⌋
Solving the above equation (which is very difficult to me) results in 1 0 0 0 0 0 0 0 0 9 < n < 1 0 0 0 0 0 0 0 1 4 with n ∈ N . So the answer is n m i n = 1 0 0 0 0 0 0 0 1 0 .
A good way to approximate the answer is using:
A = i = 1 ∑ ⌊ l o g 5 n ⌋ ⌊ 5 i n ⌋ ≈ 4 n
With n = 1 0 9 , A = 2 4 9 9 9 9 9 9 8 < 2 5 0 0 0 0 0 0 0 , so you would start counting upward.