For which value of n in N,does n! have 13 tra | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(C) The number of trailing zeros in $n!$ is determined by the exponent of $5$ in the prime factorization of $n!$,as the exponent of $2$ is always grea

Vedclass · Accepted Answer

$57$

Vedclass · Answer

(C) The number of trailing zeros in $n!$ is determined by the exponent of $5$ in the prime factorization of $n!$,as the exponent of $2$ is always greater than or equal to the exponent of $5$. The exponent of $5$ in $n!$ is given by Legendre's Formula: $E_5(n!) = \lfloor \frac{n}{5} \rfloor + \lfloor \frac{n}{25} \rfloor + \lfloor \frac{n}{125} \rfloor + \dots = 13$. Testing the options: For $n = 55$: $E_5(55!) = \lfloor \frac{55}{5} \rfloor + \lfloor \frac{55}{25} \rfloor = 11 + 2 = 13$. For $n = 56$: $E_5(56!) = \lfloor \frac{56}{5} \rfloor + \lfloor \frac{56}{25} \rfloor = 11 + 2 = 13$. For $n = 57$: $E_5(57!) = \lfloor \frac{57}{5} \rfloor + \lfloor \frac{57}{25} \rfloor = 11 + 2 = 13$. For $n = 58$: $E_5(58!) = \lfloor \frac{58}{5} \rfloor + \lfloor \frac{58}{25} \rfloor = 11 + 2 = 13$. For $n = 59$: $E_5(59!) = \lfloor \frac{59}{5} \rfloor + \lfloor \frac{59}{25} \rfloor = 11 + 2 = 13$. Since $57$ is the only value provided in the options that satisfies the condition,the correct option is $C$.

For which value of $n \in N$,does $n!$ have $13$ trailing zeros?

Similar Questions

Assuming the balls to be identical except for their color,the number of ways in which one or more balls can be selected from $10$ white,$9$ green,and $7$ black balls is:

The total number of three-digit numbers,divisible by $3$,which can be formed using the digits $1, 3, 5, 8$,if repetition of digits is allowed,is:

If ${ }^{1} P_{1}+2 \cdot{ }^{2} P_{2}+3 \cdot{ }^{3} P_{3}+\ldots+15 \cdot{ }^{15} P_{15}={ }^{q} P_{r}-s$,where $0 \leq s \leq 1$,then ${ }^{q+s} C_{r-s}$ is equal to .... .

$6$ different letters of an alphabet are given. Words with $4$ letters are formed from these given letters. The number of words which have at least one letter repeated and no two same letters are together is:

In how many ways can $3$ letters be posted in $4$ letter boxes,if all the letters are not posted in the same letter box?

Vedclass Test Series

Exam Paper Generator

Online Exam Module