Determine the number of $5$ card combinations out of a deck of $52$ cards if there is exactly one ace in each combination.
Determine the number of $5$ card combinations out of a deck of $52$ cards if there is exactly one ace in each combination.
In a deck of $52$ cards, there are $4$ aces. A combinations of $5$ cards have to be made in which there is exactly one ace.
Then, one ace can be selected in $^{4} C_{3}$ ways and the remaining $4$ cards can be selected out of the $48$ cards in $^{48} C_{4}$ ways.
Thus, by multiplication principle, required number of $5$ card combinations $=\,^{48} C_{4} \times \,^{4} C_{1}=\frac{48 !}{4 ! 44 !} \times \frac{4 !}{1 ! 3 !}$
$=\frac{48 \times 47 \times 46 \times 45}{4 \times 3 \times 2 \times 1} \times 4 !$
$=778320$
Similar Questions
If $n$ and $r$ are two positive integers such that $n \ge r,$ then $^n{C_{r - 1}}$$ + {\,^n}{C_r} = $
If $n$ and $r$ are two positive integers such that $n \ge r,$ then $^n{C_{r - 1}}$$ + {\,^n}{C_r} = $
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?
The set $S = \left\{ {1,2,3, \ldots ,12} \right\}$ is to be partitioned into three sets $A,\,B,\, C$ of equal size . Thus $A \cup B \cup C = S$ અને $A \cap B = B \cap C = C \cap A = \emptyset $ . The number of ways to partition $S$ is
The set $S = \left\{ {1,2,3, \ldots ,12} \right\}$ is to be partitioned into three sets $A,\,B,\, C$ of equal size . Thus $A \cup B \cup C = S$ અને $A \cap B = B \cap C = C \cap A = \emptyset $ . The number of ways to partition $S$ is
- [AIEEE 2007]
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
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
If the different permutations of all the letter of the word $\mathrm{EXAMINATION}$ are listed as in a dictionary, how many words are there in this list before the first word starting with $\mathrm{E}$ ?
If the different permutations of all the letter of the word $\mathrm{EXAMINATION}$ are listed as in a dictionary, how many words are there in this list before the first word starting with $\mathrm{E}$ ?