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

In how many ways can $6$ persons be selected from $4$ officers and $8$ constables,if at least one officer is to be included?

Find the total number of $9$ digit numbers which have all the digits different.

The number of words (with or without meaning) that can be formed from all the letters of the word "$LETTER$" in which vowels never come together is

$^nC_r + 2^nC_{r-1} + ^nC_{r-2} = $

If $12 \cdot {}^{n}C_{2} = {}^{2n}C_{3}$,find $n$.

Vedclass Test Series

Exam Paper Generator

Online Exam Module