The number of ways in which an examiner can assign $30$ marks to $8$ questions, giving not less than $2$ marks to any question, is
$^{30}{C_7}$
$^{21}{C_8}$
$^{21}{C_7}$
$^{30}{C_8}$
The sum $\sum\limits_{i = 0}^m {\left( {\begin{array}{*{20}{c}}{10}\\i\end{array}} \right)} \,\left( {\begin{array}{*{20}{c}}{20}\\{m - i}\end{array}} \right)\,,$ $\left( {{\rm{where}}\,\left( {\begin{array}{*{20}{c}}p\\q\end{array}} \right)\, = 0\,{\rm{if}}\,p < q} \right)$, is maximum when m is
If $^n{P_3}{ + ^n}{C_{n - 2}} = 14n$, then $n = $
If $^{15}{C_{3r}}{ = ^{15}}{C_{r + 3}}$, then the value of $r$ is
$^{14}{C_4} + \sum\limits_{j = 1}^4 {^{18 - j}{C_3}} $ is equal to
In how many ways can one select a cricket team of eleven from $17$ players in which only $5$ players can bowl if each cricket team of $11$ must include exactly $4$ bowlers?