Find the least positive integer such that no matter how is expressed as the product of any two positive integers, at least one of these two integers contains the digit .
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.
If a factor of 1 0 n has a 2 and a 5 in its prime factorization, then that factor will end in a 0 . Therefore, we have left to consider the case when the two factors have the 2 s and the 5 s separated, in other words whether 2 n or 5 n produces a 0 first.
2 1 = 2 ∣ 5 1 = 5 2 2 = 4 ∣ 5 2 = 2 5 2 3 = 8 ∣ 5 3 = 1 2 5 and so on, until,
2 8 = 2 5 6 | 5 8 = 3 9 0 6 2 5
We see that 5 8 generates the first zero, so the answer is 0 0 8