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$