If ${}^n C_{r-1}=36$,${}^n C_r=84$,and ${}^n C_{r+1}=126$,then the value of ${}^n C_8$ is

Suppose $a_2, a_3, a_4, a_5, a_6, a_7$ are integers such that $\frac{5}{7} = \frac{a_2}{2!} + \frac{a_3}{3!} + \frac{a_4}{4!} + \frac{a_5}{5!} + \frac{a_6}{6!} + \frac{a_7}{7!}$,where $0 \leq a_j < j$ for $j = 2, 3, 4, 5, 6, 7$. The sum $a_2 + a_3 + a_4 + a_5 + a_6 + a_7$ is:

$A$ five-digit number divisible by $3$ has to be formed using the numerals $0, 1, 2, 3, 4,$ and $5$ without repetition. The total number of ways in which this can be done is:

The minimum value of $f(x) = |x - 1| + |2x - 1| + |3x - 1| + \dots + |119x - 1|$ occurs at $x$. Then $x$ is equal to

In how many ways can $n$ prizes be distributed among $n$ boys such that no boy gets all the prizes?

Let $S = \{0, 1, 2, 3, \ldots, 100\}$. The number of ways of selecting $x, y \in S$ such that $x \neq y$ and $x + y = 100$ is