$\left( {\begin{array}{*{20}{c}}n\\{n - r}\end{array}} \right)\, + \,\left( {\begin{array}{*{20}{c}}n\\{r + 1}\end{array}} \right)$, whenever $0 \le r \le n - 1$is equal to
$\left( {\begin{array}{*{20}{c}}n\\{r - 1}\end{array}} \right)$
$\left( {\begin{array}{*{20}{c}}n\\r\end{array}} \right)$
$\left( {\begin{array}{*{20}{c}}n\\{r + 1}\end{array}} \right)$
$\left( {\begin{array}{*{20}{c}}{n + 1}\\{r + 1}\end{array}} \right)$
There are $3$ sections in a question paper and each section contains $5$ questions. A candidate has to answer a total of $5$ questions, choosing at least one question from each section. Then the number of ways, in which the candidate can choose the questions, is
A car will hold $2$ in the front seat and $1$ in the rear seat. If among $6$ persons $2$ can drive, then the number of ways in which the car can be filled is
The number of four letter words that can be formed using the letters of the word $BARRACK$ is
Let $S=\{1,2,3,5,7,10,11\}$. The number of nonempty subsets of $S$ that have the sum of all elements a multiple of $3$ , is $........$
$\mathop \sum \limits_{0 \le i < j \le n} i\left( \begin{array}{l}
n\\
j
\end{array} \right)$ is equal to