Let $m, n \in \mathbb{N}$ and $\operatorname{gcd}(2, n)=1$. If $30\binom{30}{0} + 29\binom{30}{1} + \ldots + 2\binom{30}{28} + 1\binom{30}{29} = n \cdot 2^m$,then $n + m$ is equal to (Here $\binom{n}{k} = {^nC_k}$)

  • A
    $45$
  • B
    $56$
  • C
    $42$
  • D
    $36$

Explore More

Similar Questions

If $(1+x)^n=C_0+C_1 x+C_2 x^2+\ldots+C_n x^n$,then $C_0+2 C_1+3 C_2+\ldots+(n+1) C_n$ is equal to

The sum of the series $\binom{20}{0} - \binom{20}{1} + \binom{20}{2} - \binom{20}{3} + \dots + \binom{20}{10}$ is:

In the expansion of $(1 + x)^{50}$,the sum of the coefficients of odd powers of $x$ is

If $(1+x)^n = C_0 + C_1 x + C_2 x^2 + \ldots + C_n x^n$,then $C_0 + 2 C_1 + 3 C_2 + \ldots + (n+1) C_n$ is equal to

$\sum_{r=0}^{10} {}^{40-r} C_5$ is equal to

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo