Let $m$ and $n$ $(m < n)$ be two $2$-digit numbers. Then the total number of pairs $(m, n)$ such that $\operatorname{gcd}(m, n) = 6$ is . . . . . . .

In a circus,there are $10$ cages for accommodating $10$ animals. Out of these,$4$ cages are so small that $5$ out of the $10$ animals cannot enter them. In how many ways is it possible to accommodate the $10$ animals in these $10$ cages?

There are three sections in a question paper,each containing $4$ questions. If a candidate has to answer only $5$ questions from this paper without leaving any section,then the number of ways the candidate can make the choice of questions is:

If $^{n}P_{4} = 24 \times ^{n}C_{5}$,then the value of $n$ is

Consider the following two statements:
$I.$ If $n$ is a composite number,then $n$ divides $(n-1)!$.
$II.$ There are infinitely many natural numbers $n$ such that $n^3+2n^2+n$ divides $n!$.

The number of numbers greater than $5000$ and less than $9000$ that are divisible by $3$, which can be formed using the digits $0, 1, 2, 5, 9$ with repetition allowed, is . . . . . . .