$2^n \{1 \cdot 3 \cdot 5 \cdot \dots \cdot (2n - 3) \cdot (2n - 1)\} = \dots$

Total number of $3$-digit numbers that are divisible by $6$ and can be formed by using the digits $1, 2, 3, 4, 5$ with repetition is $.......$.

The number of four-digit natural numbers which contain exactly two distinct digits is:

The number of ways of selecting $8$ letters from $24$ letters,of which $8$ are $a$,$8$ are $b$,and the remaining $8$ are distinct,is given by:

For a natural number $n$,the inequality $2^n(n - 1)! < n^n$ holds true if:

Number of all possible words (with or without meaning) that can be formed using all the letters of the word $CABINET$ in which neither the word $CAB$ nor the word $NET$ appear is