$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

The greatest integer which divides $(p+1)(p+2)(p+3) \ldots (p+q)$ for all $p \in N$ and fixed $q \in N$ is

$A$ bag contains $23$ balls, of which $7$ are identical. The number of ways of selecting $12$ balls from the bag is:

At an election,a voter may vote for any number of candidates,not greater than the number to be elected. There are $10$ candidates and $4$ are to be selected. If a voter votes for at least one candidate,then the number of ways in which he can vote is:

$A$ father with $8$ children takes them $3$ at a time to the Zoological gardens,as often as he can without taking the same $3$ children together more than once. The number of times each child will go to the garden is

In how many ways can a team of $11$ players be formed out of $25$ players,if $6$ out of them are always to be included and $5$ are always to be excluded?

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