A committee of $7$ has to be formed from $9$ boys and $4$ girls. In how many ways can this be done when the committee consists of:
at most $3$ girls?
since atmost $3$ girls are to be there in every committee, the committee can consist of
$(a)$ $3$ girls and $4$ boys
$(b)$ $2$ girls and $5$ boys
$(c)$ $1$ girl and $6$ boys
$(d)$ No girl and $7$ boys
$3$ girls and $4$ boys can be selected in $^{4} C_{3} \times^{9} C_{4}$ ways.
$2$ girls and $5$ boys can be selected in $^{4} C_{2} \times^{9} C_{5}$ ways.
$1$ girl and $6$ boys can be selected in $^{4} C_{1} \times^{9} C_{6}$ ways.
No girl and $7$ boys can be selected in $^{4} C_{0} \times^{9} C_{7}$ ways.
Therefore, in this case, required number of ways
$=^{4} C_{3} \times^{9} C_{4}+^{4} C_{2} \times^{9} C_{5}+^{4} C_{1} \times^{9} C_{6}+^{4} C_{0} \times^{9} C_{7}$
$=\frac{4 !}{3 ! 1 !} \times \frac{9 !}{4 ! 5 !}+\frac{4 !}{2 ! 2 !} \times \frac{9 !}{5 ! 4 !}+\frac{4 !}{1 ! 3 !} \times \frac{9 !}{6 ! 3 !}+\frac{4 !}{0 ! 4 !} \times \frac{9 !}{7 ! 2 !}$
$=504+756+336+36$
$=1632$
There are $3$ sections in a question paper and each section contains $5$ questions. A candidate has to answer a total of $5$ questions, choosing at least one question from each section. Then the number of ways, in which the candidate can choose the questions, is
In an election there are $8$ candidates, out of which $5$ are to be choosen. If a voter may vote for any number of candidates but not greater than the number to be choosen, then in how many ways can a voter vote
A class contains $b$ boys and $g$ girls. If the number of ways of selecting $3$ boys and $2$ girls from the class is $168$, then $b +3\,g$ is equal to.
There are $m$ men and two women participating in a chess tournament. Each participant plays two games with every other participant. If the number of games played by the men between themselves exceeds the number of games played between the men and the women by $84,$ then the value of $m$ is
The sum $\sum\limits_{i = 0}^m {\left( {\begin{array}{*{20}{c}}{10}\\i\end{array}} \right)} \,\left( {\begin{array}{*{20}{c}}{20}\\{m - i}\end{array}} \right)\,,$ $\left( {{\rm{where}}\,\left( {\begin{array}{*{20}{c}}p\\q\end{array}} \right)\, = 0\,{\rm{if}}\,p < q} \right)$, is maximum when m is