The largest power of 2 that divides frac{200! | vedclass

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

Question

(C) To find the largest power of $2$ that divides $\frac{200!}{100!}$,we use Legendre's Formula,which states that the exponent of a prime $p$ in $n!$

Vedclass · Accepted Answer

$100$

Vedclass · Answer

(C) To find the largest power of $2$ that divides $\frac{200!}{100!}$,we use Legendre's Formula,which states that the exponent of a prime $p$ in $n!$ is given by $E_p(n!) = \sum_{k=1}^{\infty} \lfloor \frac{n}{p^k} \rfloor$.First,calculate the exponent of $2$ in $200!$:$E_2(200!) = \lfloor \frac{200}{2} \rfloor + \lfloor \frac{200}{4} \rfloor + \lfloor \frac{200}{8} \rfloor + \lfloor \frac{200}{16} \rfloor + \lfloor \frac{200}{32} \rfloor + \lfloor \frac{200}{64} \rfloor + \lfloor \frac{200}{128} \rfloor$$= 100 + 50 + 25 + 12 + 6 + 3 + 1 = 197$.Next,calculate the exponent of $2$ in $100!$:$E_2(100!) = \lfloor \frac{100}{2} \rfloor + \lfloor \frac{100}{4} \rfloor + \lfloor \frac{100}{8} \rfloor + \lfloor \frac{100}{16} \rfloor + \lfloor \frac{100}{32} \rfloor + \lfloor \frac{100}{64} \rfloor$$= 50 + 25 + 12 + 6 + 3 + 1 = 97$.The exponent of $2$ in $\frac{200!}{100!}$ is $E_2(200!) - E_2(100!) = 197 - 97 = 100$.Therefore,the largest power of $2$ is $100$.

The largest power of $2$ that divides $\frac{200!}{100!}$ is

Similar Questions

The number of $5$-digit numbers that are not divisible by $5$ and consist of different odd digits is:

Two packs of $52$ cards are shuffled together. The number of ways in which a man can be dealt $26$ cards so that he does not get two cards of the same suit and same denomination is

Let $n_1 < n_2 < n_3 < n_4 < n_5$ be positive integers such that $n_1+n_2+n_3+n_4+n_5=20$. Then the number of such distinct arrangements $(n_1, n_2, n_3, n_4, n_5)$ is

Let the digits $a, b, c$ be in $A.P.$ Nine-digit numbers are to be formed using each of these three digits thrice such that three consecutive digits are in $A.P.$ at least once. How many such numbers can be formed?

In a circus,there are $10$ cages for accommodating $10$ animals. Out of these,$4$ cages are so small that $5$ out of the $10$ animals cannot enter them. In how many ways is it possible to accommodate the $10$ animals in these $10$ cages?

Vedclass Test Series

Exam Paper Generator

Online Exam Module