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?

Vedclass pdf generator app on play store
Vedclass iOS app on app store

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$

Similar Questions

Let $n(A) = 3, \,n(B) = 3$ (where $n(S)$ denotes number of elements in set $S$), then number of subsets of $(A \times B)$ having odd number of elements, is-

A company has $10$ employes. The company has decided to form a team including atleast three employes and also excluding atleast three employes. Then the number of ways of forming the team is

A  man $X$  has $7$  friends, $4$  of them are ladies and  $3$ are men. His wife $Y$ also has $7$ friends, $3$ of  them are  ladies and $4$ are men. Assume $X$ and $Y$ have no comman friends. Then the total number of ways in which $X$ and $Y$ together  can throw a party inviting $3$ ladies and $3$ men, so that $3$ friends of each of $X$ and $Y$ are in this party is :

  • [JEE MAIN 2017]

A committee of $4$ persons is to be formed from $2$ ladies, $2$ old men and $4$ young men such that it includes at least $1$ lady, at least $1$ old man and at most $2$ young men. Then the total number of ways in which this committee can be formed is

  • [JEE MAIN 2013]

The number of words (with or without meaning) that can be formed from all the letters of the word $"LETTER"$ in which vowels never come together is

  • [JEE MAIN 2020]