If $\alpha = ^mC_2$,then $^\alpha C_2$ is equal to

$A$ five-digit number divisible by $3$ has to be formed using the numerals $0, 1, 2, 3, 4,$ and $5$ without repetition. The total number of ways in which this can be done is:

$A$ pack contains $n$ cards numbered from $1$ to $n$. Two consecutive numbered cards are removed from the pack and the sum of the numbers on the remaining cards is $1224$. If the smaller of the numbers on the removed cards is $k$,then $k - 20 =$

If $a + b + c = 50$ and $a, b, c$ are non-negative even integers,then the greatest value of $ab^2c$ is:

If the number of circular permutations of $9$ distinct things taken $5$ at a time is $n_1$ and the number of linear permutations of $8$ distinct things taken $4$ at a time is $n_2$,then $\frac{n_1}{n_2}=$

Among the inequalities below,which ones are true for all natural numbers $n > 1000$?
$I. n! \leq n^n$
$II. (n!)^2 \leq n^n$
$III. 10^n \leq n!$
$IV. n^n \leq (2n)!$