The number of consecutive zeros at the end of the expansion of a factorial, \(n!\), is determined by the number of times 10 is a factor in its prime factorization. Since \(10 = 2 \times 5\), we need to count the pairs of 2s and 5s. In any factorial \(n!\), the number of factors of 2 is always greater than or equal to the number of factors of 5. Therefore, the number of trailing zeros is simply the count of the factors of 5 in the prime factorization of \(n!\).
We can find the total number of factors of a prime \(p\) in \(n!\) using Legendre's formula:
\(\nu_p(n!) = \sum_{i=1}^{\infty} \left\lfloor \frac{n}{p^i} \right\rfloor\)
For trailing zeros, we are interested in the number of factors of 5, so \(p=5\). The formula becomes:
\(Z(n) = \nu_5(n!) = \left\lfloor \frac{n}{5} \right\rfloor + \left\lfloor \frac{n}{25} \right\rfloor + \left\lfloor \frac{n}{125} \right\rfloor + \dots\)
We are looking for the number of values of the natural number \(n\) for which \(Z(n) = 2\).
Let's analyze the formula \(Z(n) = \left\lfloor \frac{n}{5} \right\rfloor + \left\lfloor \frac{n}{25} \right\rfloor + \dots\). We want \(Z(n) = 2\).
Consider the first term, \(\lfloor \frac{n}{5} \rfloor\).
Now, let's consider the impact of the \(\lfloor \frac{n}{25} \rfloor\) term. The smallest value of \(n\) for which \(\lfloor \frac{n}{25} \rfloor\) is non-zero is \(n=25\).
Since the number of zeros increases as \(n\) increases, and we already found \(Z(n) = 3\) for \(n \ge 15\), any \(n \ge 25\) will result in \(Z(n) \ge 6\).
The only natural numbers \(n\) for which \(n!\) has exactly 2 consecutive zeros at the end are \(n = 10, 11, 12, 13, 14\). Counting these values, we find there are 5 possible values for \(n\).
If x = (1111)₂, y = (1001)₂ and z = (110)₂, then what is x³ - y³ - z³ - 3xyz equal to?
If 1 is added to each odd digit and 2 is subtracted from each even digit in the number 8317456, what will be the sum of the digits that are second from the left and second from the right?