The problem is this: What is the largest *n* such that 1005! is evenly divisible by 10^{n}? Put another way, how many 0's does the expansion of 1005! end with?

Highlight the following blank space for the solution:

Imagine writing out the expansion of 1005!, and then replacing each number with its prime factorization. The prime factors of 10 are 5 and 2, so our question is equivalent to asking how many (5,2) pairs this expansion contains. It is easy to see that it contains far more 2's than 5's, so the question becomes: How many 5's are in the expansion? Every number in the original expansion of 1005! that is divisible by 5 contributes a 5 in the prime-factorization expansion; there are 201 of these. However, every number that is divisible by 5^{2}, i.e. 25, contributes a second 5; this adds 40 more. Every number that is divisible by 5^{3}, i.e. 125, contributes a third 5; add 8 more. Finally, the one number that is divisible by 5^{4}, i.e. 625, contributes a fourth 5, adding one more and bringing the total count to *n* = 250.