If 33! is divisible by 2^n,where n in N,then | vedclass

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

Question

(C) To find the highest power of a prime $p$ dividing $n!$,we use Legendre's Formula: $E_p(n!) = \sum_{k=1}^{\infty} \lfloor \frac{n}{p^k} \rfloor$.Fo

Vedclass · Accepted Answer

$496$

Vedclass · Answer

(C) To find the highest power of a prime $p$ dividing $n!$,we use Legendre's Formula: $E_p(n!) = \sum_{k=1}^{\infty} \lfloor \frac{n}{p^k} floor$.For $n = 33$ and $p = 2$:$E_2(33!) = \lfloor \frac{33}{2} floor + \lfloor \frac{33}{4} floor + \lfloor \frac{33}{8} floor + \lfloor \frac{33}{16} floor + \lfloor \frac{33}{32} floor$$E_2(33!) = 16 + 8 + 4 + 2 + 1 = 31$.This means $33!$ is divisible by $2^n$ for all $n \in \{1, 2, 3, \dots, 31\}$.The sum of all possible values of $n$ is the sum of the first $31$ natural numbers:Sum $= \frac{n(n+1)}{2} = \frac{31 	imes 32}{2} = 31 	imes 16 = 496$.

If $33!$ is divisible by $2^n$,where $n \in N$,then the sum of all possible values of $n$ is:

Similar Questions

Each section in the first year of a plus $2$ course has exactly $40$ students. If there are $5$ sections,in how many ways can a set of $4$ student representatives be selected,$1$ from each section?

How many numbers lying between $99$ and $1000$ can be formed using the digits $2, 3, 7, 0, 8, 6$,if each digit can be used only once in each number?

The number of four-letter words that can be formed using the letters of the word $BARRACK$ is

If $^{12}P_r = 1320$,then $r$ is equal to

Vedclass Test Series

Exam Paper Generator

Online Exam Module