# Explanation for the the number of trailing zeros in a factorial.

I was doing a programming problem that asked that I find the number of trailing zeros for a factorial, and I came up with this:

function zeros (n) {
let numZeros = 0, power = 5;
while (power <= n) {
numZeros += Math.floor(n / power);
power *= 5;
}
return numZeros;
}


Basically through trial and error I found that the number of zeros in a given factorial was equal to:

$$\frac{n}{5} + \frac{n}{25} +...+\frac{n}{5^x}$$

While $5^x$ was less than or equal to n, and $\frac{n}{5^x}$ was rounded down to an integer value.

I'd like to be able to write some kind of proof for this, but I don't know where to get started. I've never written a proof before.

• See de Polignac's formula. The number of trailing $0$'s in a number is the minimum of the exponents of $2$ and $5$ in its prime decomposition. Commented Nov 24, 2015 at 0:54
• @RobertIsrael I've having a tough time trying to relate de Polignac's formula to the one I came up with. Could you please help me see the connection in more detail? Commented Nov 24, 2015 at 1:00

You add a zero every time that you multiply by $10$. Since the only prime factors of $10$ are $2$ and $5$, then clearly the trailing number of zeros in a number is the minimum of the two exponents in the prime factorization of that number.

To relate this to the formula you found, note that when computing a factorial, you will add a zero to the end every time that you multiply by a multiple of $5$—there's always an upaired factor of $2$ available to make $10$. When that multiple of $5$ is also a multiple of $25$, you’ll add an extra zero, three zeros when you hit a multiple of $5^3$, and so on.

About de Polignac's formula: You found yourself how many factors 5 the number n! has: The number of factors 5 is n/5 + n/25 + n/125...

If you take other prime numbers, then you get very similar results: The number of factors 2 is n/2 + n/4 + n/8 ..., then number of factors 103 is n/103 + n/103^2 + n/103^3 ... and so on.

$s_p(n)$ is the formula you found, for the prime number p. You found how often the factor 5 is there; to turn that into a number you calculate $5^{your formula}$. And then you do that for all the primes and multiply, and you get the formula for n! on that page.

• So how does the number of factors of 5 relate to the number of zeros? Commented Nov 24, 2015 at 1:10
• @AR7: If you factor the factorial into primes, each zero represents a factor of $2 \cdot 5$. As there are lots more factors of $2$ than $5$, the number of zeros is set by the number of factors of $5$. As a sum of a geometric series, the number of zeros at the end of $n!$ will be just a few less than $\frac n4$ Commented Nov 24, 2015 at 1:12
• @RossMillikan That makes a lot of sense now thank you. Commented Nov 24, 2015 at 1:17
The text passage discusses a method for calculating the number of trailing zeros in a factorial and provides a function to do so. It also explains the mathematical reasoning behind the method, referencing de Polignac's formula and the relationship between factors of 2 and 5 in the prime factorization of a number.
no_question

the passage does not contain a direct mathematical question or a request for a specific calculation. instead, it provides an explanation and a discussion of a mathematical concept.
Given a text passage, determine:
    1. If it contains a mathematical question (including word problems or calculations)
    2. If an answer to that mathematical question is provided in the text

First, describe the content structure you found in 1-2 sentences.

Then provide your analysis in the following format:
TYPE: <one of the following values>
- NO_QUESTION
- SINGLE_QUESTION
- SINGLE_QUESTION_WITH_ANSWER
- MULTIPLE_QUESTIONS
- MULTIPLE_QUESTIONS_WITH_ANSWERS
system
# Explanation for the the number of trailing zeros in a factorial.

I was doing a programming problem that asked that I find the number of trailing zeros for a factorial, and I came up with this:

function zeros (n) {
let numZeros = 0, power = 5;
while (power <= n) {
numZeros += Math.floor(n / power);
power *= 5;
}
return numZeros;
}


Basically through trial and error I found that the number of zeros in a given factorial was equal to:

$$\frac{n}{5} + \frac{n}{25} +...+\frac{n}{5^x}$$

While $5^x$ was less than or equal to n, and $\frac{n}{5^x}$ was rounded down to an integer value.

I'd like to be able to write some kind of proof for this, but I don't know where to get started. I've never written a proof before.

• See de Polignac's formula. The number of trailing $0$'s in a number is the minimum of the exponents of $2$ and $5$ in its prime decomposition. Commented Nov 24, 2015 at 0:54
• @RobertIsrael I've having a tough time trying to relate de Polignac's formula to the one I came up with. Could you please help me see the connection in more detail? Commented Nov 24, 2015 at 1:00

You add a zero every time that you multiply by $10$. Since the only prime factors of $10$ are $2$ and $5$, then clearly the trailing number of zeros in a number is the minimum of the two exponents in the prime factorization of that number.

To relate this to the formula you found, note that when computing a factorial, you will add a zero to the end every time that you multiply by a multiple of $5$—there's always an upaired factor of $2$ available to make $10$. When that multiple of $5$ is also a multiple of $25$, you’ll add an extra zero, three zeros when you hit a multiple of $5^3$, and so on.

About de Polignac's formula: You found yourself how many factors 5 the number n! has: The number of factors 5 is n/5 + n/25 + n/125...

If you take other prime numbers, then you get very similar results: The number of factors 2 is n/2 + n/4 + n/8 ..., then number of factors 103 is n/103 + n/103^2 + n/103^3 ... and so on.

$s_p(n)$ is the formula you found, for the prime number p. You found how often the factor 5 is there; to turn that into a number you calculate $5^{your formula}$. And then you do that for all the primes and multiply, and you get the formula for n! on that page.

• So how does the number of factors of 5 relate to the number of zeros? Commented Nov 24, 2015 at 1:10
• @AR7: If you factor the factorial into primes, each zero represents a factor of $2 \cdot 5$. As there are lots more factors of $2$ than $5$, the number of zeros is set by the number of factors of $5$. As a sum of a geometric series, the number of zeros at the end of $n!$ will be just a few less than $\frac n4$ Commented Nov 24, 2015 at 1:12
• @RossMillikan That makes a lot of sense now thank you. Commented Nov 24, 2015 at 1:17
user
The text passage discusses a method for calculating the number of trailing zeros in a factorial and provides a function to do so. It also explains the mathematical reasoning behind the method, referencing de Polignac's formula and the relationship between factors of 2 and 5 in the prime factorization of a number.

TYPE: NO_QUESTION

The passage does not contain a direct mathematical question or a request for a specific calculation. Instead, it provides an explanation and a discussion of a mathematical concept.