A committee of $3$ persons is to be constituted from a group of $2$ men and $3$ women. In how many ways can this be done? How many of these committees would consist of $1$ man and $2$ women?
Here, order does not matter. Therefore, we need to count combinations. There will be as many committees as there are combinations of $5$ different persons taken $3$ at a time. Hence, the required number of ways $=\,^{5} C _{3}=\frac{5 !}{3 ! 2 !}=\frac{4 \times 5}{2}=10.$
Now, $1$ man can be selected from $2$ men in $^{2} C _{1}$ ways and $2$ women can be selected from $3$ women in $^{3} C _{2}$ ways. Therefore, the required number of committees
$=\,^{2} C_{1} \times^{3} C_{2}=\frac{2 !}{1 ! 1 !} \times \frac{3 !}{2 ! 1 !}=6$
A group consists of $4$ girls and $7$ boys. In how many ways can a team of $5$ members be selected if the team has no girl?
Two packs of $52$ cards are shuffled together. The number of ways in which a man can be dealt $26$ cards so that he does not get two cards of the same suit and same denomination is
A set contains $2n + 1$ elements. The number of subsets of this set containing more than $n$ elements is equal to
If for some $\mathrm{m}, \mathrm{n} ;{ }^6 \mathrm{C}_{\mathrm{m}}+2\left({ }^6 \mathrm{C}_{\mathrm{m}+1}\right)+{ }^6 \mathrm{C}_{\mathrm{m}+2}>{ }^8 \mathrm{C}_3$ and ${ }^{n-1} P_3:{ }^n P_4=1: 8$, then ${ }^n P_{m+1}+{ }^{n+1} C_m$ is equal to
In how many ways can $5$ girls and $3$ boys be seated in a row so that no two boys are together?