There are three sections in a question paper,each section containing $4$ questions. If a candidate has to answer exactly $5$ questions from this paper such that at least one question is answered from each section,then the number of ways in which a candidate can make the choice of questions is

Let $n_1 < n_2 < n_3 < n_4 < n_5$ be positive integers such that $n_1+n_2+n_3+n_4+n_5=20$. Then the number of such distinct arrangements $(n_1, n_2, n_3, n_4, n_5)$ is

All the letters of the word $ANIMAL$ are permuted in all possible ways and the permutations thus formed are arranged in dictionary order. If the rank of the word $ANIMAL$ is $x$,then the permutation with rank $x$,among the permutations obtained by permuting the letters of the word $PERSON$ and arranging the permutations thus formed in dictionary order is

The value of ${2^n} \{ 1 \cdot 3 \cdot 5 \cdots (2n - 3) \cdot (2n - 1) \}$ is

Let $m = (9n^2 + 54n + 80)(9n^2 + 45n + 54)(9n^2 + 36n + 35)$. The greatest positive integer which divides $m$ for all positive integers $n$ is:

If $n$ is an integer with $0 \leq n \leq 11$,then the minimum value of $n!(11-n)!$ is attained when a value of $n$ equals to