In how many ways can a team of $3$ boys and $3$ girls be selected from $5$ boys and $4$ girls?
In how many ways can a team of $3$ boys and $3$ girls be selected from $5$ boys and $4$ girls?
A team of $3$ boys and $3$ girls is to be selected from $5$ boys and $4$ girls.
$3$ boys can be selected from $5$ boys in $^{5} C_{3}$ ways.
$3$ girls can be selected from $4$ girls in $^{4} C_{3}$ ways.
Therefore, by multiplication principle, number of ways in which a team of $3$ boys and $3$ girls can be selected $=^{5} C_{3} \times^{4} C_{3}=\frac{5 !}{3 ! 2 !} \times \frac{4 !}{3 ! 1 !}$
$=\frac{5 \times 4 \times 3 !}{3 ! \times 2} \times \frac{4 \times 3 !}{3 !}$
$=10 \times 4=40$
Similar Questions
If $'n'$ objects are arranged in a row then the number of ways of selecting three of these objects so that no two of them are next to each othe
If $'n'$ objects are arranged in a row then the number of ways of selecting three of these objects so that no two of them are next to each othe
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 of be selected, if a voter votes for at least one candidate, then the number of ways in which he can vote 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 of be selected, if a voter votes for at least one candidate, then the number of ways in which he can vote is
- [AIEEE 2006]
Everybody in a room shakes hand with everybody else. The total number of hand shakes is $66$. The total number of persons in the room is
Everybody in a room shakes hand with everybody else. The total number of hand shakes is $66$. The total number of persons in the room is
The number of ways five alphabets can be chosen from the alphabets of the word $MATHEMATICS$, where the chosen alphabets are not necessarily distinct, is equal to :
The number of ways five alphabets can be chosen from the alphabets of the word $MATHEMATICS$, where the chosen alphabets are not necessarily distinct, is equal to :
- [JEE MAIN 2024]
In how many ways can the letters of the word $\mathrm{ASSASSINATION} $ be arranged so that all the $\mathrm{S}$ 's are together?
In how many ways can the letters of the word $\mathrm{ASSASSINATION} $ be arranged so that all the $\mathrm{S}$ 's are together?