$A$ group of $9$ students,$s_1, s_2, \ldots, s_9$,is to be divided into three teams $X, Y$,and $Z$ of sizes $2, 3$,and $4$,respectively. Suppose that $s_1$ cannot be selected for team $X$,and $s_2$ cannot be selected for team $Y$. The number of ways to form such teams is:

  • A
    $660$
  • B
    $661$
  • C
    $664$
  • D
    $665$

Explore More

Similar Questions

If the domain and range of $f(x) = ^{9-x}C_{x-1}$ contain $m$ and $n$ elements respectively,then:

If $\frac{1}{{ }^{5}C_{r}} + \frac{1}{{ }^{6}C_{r}} = \frac{1}{{ }^{4}C_{r}},$ then the value of $r$ is

There are $15$ players in a cricket team,out of which $6$ are bowlers,$7$ are batsmen,and $2$ are wicketkeepers. The number of ways a team of $11$ players can be selected from them so as to include at least $4$ bowlers,$5$ batsmen,and $1$ wicketkeeper is $.....$

$^nC_r + ^{n-1}C_r + ...... + ^rC_r =$

Difficult
View Solution

$A$ student has to answer $10$ out of $13$ questions in an examination. The number of ways in which he can answer if he must answer at least $3$ of the first $5$ questions is:

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo