A group of $9$ students, $s 1, s 2, \ldots, s 9$, is to be divided to form three teams $X, Y$ and, $Z$ of sizes $2,3$ , and $4$, respectively. Suppose that $s_1$ cannot be selected for the team $X$, and $s_2$ cannot be selected for the team $Y$. Then the number of ways to form such teams, is. . . .
$660$
$661$
$664$
$665$
Six ‘$+$’ and four ‘$-$’ signs are to placed in a straight line so that no two ‘$-$’ signs come together, then the total number of ways are
Determine $n$ if
$^{2 n} C_{3}:^{n} C_{3}=11: 1$
$^n{C_r}{ + ^{n - 1}}{C_r} + ......{ + ^r}{C_r}$ =
$^{20}C_1 + 3 ^{20}C_2 + 3 ^{20}C_3 + ^{20}C_4$ is equal to-
There are $m$ books in black cover and $n$ books in blue cover, and all books are different. The number of ways these $(m+n)$ books can be arranged on a shelf so that all the books in black cover are put side by side is