Bunuel wrote:
How many positive integer n are there, such that n! ends with exactly 30 zeroes?
A. 0
B. 1
C. 2
D. 3
E. 4
Typically, we are given the value of n and asked to determine the number of trailing zeros of n!. For example, how many trailing zeros does 10! have? However, this problem is asking for the reverse.
Recall that the number of trailing zeros of n! depends on the number of 5-and-2 pairs that are contained in n!. However, since there are fewer 5s than 2s, it really depends on the number of 5s that are contained in n!. So let’s determine the smallest value of n such that n! ends with exactly 30 zeroes. Such a value of n must be a multiple of 5. That is, if there exists a value of n such that n! (where n is a multiple of 5) has exactly 30 zeros, then (n + 5)! must have at least 31 zeros (notice n + 5 is the next multiple of 5, which makes (n + 5)! having at least one more factor of 5 than n!). So let’s list the number of zeros of n! (where n is a multiple of 5) starting with 5!:
n! Number of trailing zeros
5! 1
10! 2
15! 3
20! 4
25! 6 (Notice 25 has 2 factors of 5, so the number of trailing zeros jumps by 2 from 20!.)
30! 7
35! 8
40! 9
45! 10
50! 12 (Notice 50 has 2 factors of 5, so the number of trailing zeros jumps by 2 from 45!.
Also, we can do things a little faster, increase the value of n by 25, since we can
see that the number of trailing zeros will be increased by 6.)
75! 18
100! 24 (If we continue with the shortcut, the next one will be 125!. However, since 125 has
3 factors of 5, so let’s go back to the increments of 5.)
105! 25
110! 26
115! 27
120! 28
125! 31 (Notice 125 has 3 factors of 5, so the number of trailing zeros jumps by 3 from 124!.)
As we can see from the list above, there are no values of n such that n! has exactly 30 trailing zeros. (Notice that n! has 28 trailing zeros for n = 120, 121, 122, 123 and 124, but it has 31 trailing zeros when n = 125.)
Answer: A