$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 =$

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$

$^{37}C_4 + \sum_{r=1}^{5} {^{(42-r)}C_r} = $

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 different signals which can be given from $7$ different coloured sheets,taking one or more at a time is

An eight-digit number divisible by $9$ is to be formed using digits from $0$ to $9$ without repeating the digits. The number of ways in which this can be done is: (in $(7!)$)