Consider the set $A = \{1, 2, 3, \ldots, 30\}$. The number of ways in which one can choose three distinct numbers from $A$ such that the product of the chosen numbers is divisible by $9$ is:

Let $S_1 = \{(i, j, k) : i, j, k \in \{1, 2, \ldots, 10\}\}$,$S_2 = \{(i, j) : 1 \leq i < j + 2 \leq 10, i, j \in \{1, 2, \ldots, 10\}\}$,$S_3 = \{(i, j, k, l) : 1 \leq i < j < k < l, i, j, k, l \in \{1, 2, \ldots, 10\}\}$,$S_4 = \{(i, j, k, l) : i, j, k \text{ and } l \text{ are distinct elements in } \{1, 2, \ldots, 10\}\}$. If the total number of elements in the set $S_r$ is $n_r$ for $r = 1, 2, 3, 4$,then which of the following statements is (are) $TRUE$?
$(A) n_1 = 1000$
$(B) n_2 = 44$
$(C) n_3 = 220$
$(D) \frac{n_4}{12} = 420$

If $n$ is the number of ways five different employees can sit into four indistinguishable offices where any office may have any number of persons including zero,then $n$ is equal to:

The number of seven-digit integers,with the sum of the digits equal to $10$ and formed by using the digits $1, 2,$ and $3$ only,is

If $\alpha$ represents the number of arrangements of $p$ men and $q$ women in a row such that all men are together and $\beta$ represents the number of circular arrangements of the same people with the same condition,then $\alpha: \beta$ is

The number of ways of getting a sum of $16$ when throwing a die four times is: