Let $m$ (respectively,$n$) be the number of $5$-digit integers obtained by using the digits $1, 2, 3, 4, 5$ with repetitions (respectively,without repetitions) such that the sum of any two adjacent digits is odd. Then $\frac{m}{n}$ is equal to

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$

The number of ways of giving $20$ distinct oranges to $3$ children such that each child gets at least one orange is $............$.

In how many ways can the letters of the word $ASSASSIN$ be arranged so that no two $S$s occur together?

Team $A$ consists of $7$ boys and $n$ girls and Team $B$ has $4$ boys and $6$ girls. If a total of $52$ single matches can be arranged between these two teams when a boy plays against a boy and a girl plays against a girl,then $n$ is equal to

Find the number of different signals that can be generated by arranging at least $2$ flags in order (one below the other) on a vertical staff,if five different flags are available.