Let m, n N and gcd(2, n)=1. If 30 ( l 30 0 )+29 ( l 30 1 )+ +2 ( … - Vidyadip

MCQ

Let $m, n \in N$ and $\operatorname{gcd}(2, n)=1$. If $30\left(\begin{array}{l}30 \\ 0\end{array}\right)+29\left(\begin{array}{l}30 \\ 1\end{array}\right)+\ldots+2\left(\begin{array}{l}30 \\ 28\end{array}\right)+1\left(\begin{array}{l}30 \\ 29\end{array}\right)= n .2^{ m }$ then $n + m$ is equal to (Here $\left.\left(\begin{array}{l} n \\ k \end{array}\right)={ }^{ n } C _{ k }\right)$

✓
$45$
B
$56$
C
$42$
D
$36$

✓

Answer

Correct option: A.

$45$

a
$30\left({ }^{30} C _{0}\right)+29\left({ }^{30} C _{1}\right)+\ldots+2\left({ }^{30} C _{28}\right)+1\left({ }^{30} C _{29}\right)$

$=30\left({ }^{30} C _{30}\right)+29\left({ }^{30} C _{29}\right)+\ldots \ldots+2\left({ }^{30} C _{2}\right)+1\left({ }^{30} C _{1}\right)$

$=\sum_{ r =1}^{30} r \left({ }^{30} C _{ r }\right)$

$=\sum_{ r =1}^{30} r \left(\frac{30}{ r }\right)\left({ }^{29} C _{ r -1}\right)$

$=30 \sum_{ r =1}^{30}{ }^{29} C _{ r -1}$

$=30\left({ }^{29} C _{0}+{ }^{29} C _{1}+{ }^{29} C _{2}+\ldots+{ }^{29} C _{29}\right)$

$=30\left(2^{29}\right)=15(2)^{30}= n (2)^{ m }$

$\therefore n =15, m =30$

$n + m =45$

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free

Explore more

More "M.C.Q (1 Marks)" from STD 11 - 7. binomial theoram→STD 11 - 7. binomial theoram — all question types→Maths STD 11 Science question papers→CBSE Board STD 11 Science question papers→CBSE Board question paper generator→

Similar questions

The sum of the digits in unit place of all the numbers formed with the help of $3, 4, 5$ and $6$ taken all at a time is.

$\sinh ix$ is [EAMCET 2002]

The largest non-negative integer $k$ such that $24^k$ divides $13\,!$ is

$\mathop {\lim }\limits_{x \to 0} \frac{{\tan 2x - x}}{{3x - \sin x}} = $

The sums of $n$ terms of three $A.P.'s$ whose first term is $1$ and common differences are $1, 2, 3$ are ${S_1},\;{S_2},\;{S_3}$ respectively. The true relation is

$\mathop {\lim }\limits_{x \to 0} \,\,\frac{{{{\log }_e}(1 + x)}}{{{3^x} - 1}} = $

The chance of throwing a total of $7$ or $12$ with $2$ dice, is

The number of real values of $\lambda$ for which the lines $\text{x} - 2\text{y} + 3 = 0, \lambda\text{x} + 3\text{y} + 1 = 0$ and $4\text{x} - \lambda\text{y} + 2 = 0$ are concurrent is:

Let $\mathrm{X}$ and $\mathrm{Y}$ be two events such that $\mathrm{P}(\mathrm{X})=\frac{1}{3}, \mathrm{P}(\mathrm{X} \mid \mathrm{Y})=\frac{1}{2}$ and $\mathrm{P}(\mathrm{Y} \mid \mathrm{X})=\frac{2}{5}$. Then

$[A]$ $\mathrm{P}\left(\mathrm{X}^{\prime} \mid \mathrm{Y}\right)=\frac{1}{2}$ $[B]$ $\mathrm{P}(\mathrm{X} \cap \mathrm{Y})=\frac{1}{5}$ $[C]$ $\mathrm{P}(\mathrm{X} \cup \mathrm{Y})=\frac{2}{5}$ $[D]$ $\mathrm{P}(\mathrm{Y})=\frac{4}{15}$

If $z$ is a complex number such that $|z - \bar{z}| = 2$ and $|z + \bar{z}| = 4 $, then which of the following is always incorrect -