From a class of $25$ students, $10$ are to be chosen for an excursion party. There are $3$ students who decide that either all of them will join or none of them will join. In how many ways can the excursion party be chosen?
From the class of $25$ students, $10$ are to be chosen for an excursion party.
since there are $3$ students who decide that either all of them will join or none fo them will join, there are two cases.
Case $I:$ All the three students join.
Then, the remaining $7$ students can be chosen from the remaining $22$ students in $^{22} C_{7}$ ways.
Case $II:$ None of the three students join.
Then, $10$ students can be chosen from the remaining $22$ students in $^{22} C_{10}$ ways.
Thus, required number of ways of choosing the excursion party is $^{22} C_{7}+^{22} C_{10}.$
If $n$ is even and the value of $^n{C_r}$ is maximum, then $r = $
Suppose Anil's mother wants to give $5$ whole fruits to Anil from a basket of $7$ red apples, $5$ white apples and $8$ oranges. If in the selected $5$ fruits, at least $2$ orange, at least one red apple and at least one white apple must be given, then the number of ways, Anil's mother can offer $5$ fruits to Anil is $........$
The number of ways in which a committee of $6$ members can be formed from $8 $ gentlemen and $4$ ladies so that the committee contains at least $3$ ladies is
$^n{C_r}{ + ^{n - 1}}{C_r} + ......{ + ^r}{C_r}$ =
What is the number of ways of choosing $4$ cards from a pack of $52$ playing cards? In how many of these
four cards belong to four different suits,