What is the number of ways of choosing $4$ cards from a pack of $52$ playing cards? In how many of these
two are red cards and two are black cards,
What is the number of ways of choosing $4$ cards from a pack of $52$ playing cards? In how many of these
two are red cards and two are black cards,
There will be as many ways of choosing $4$ cards from $52$ cards as there are combinations of $52$ different things, taken $4$ at a time. Therefore
The required number of ways $=\,^{52} C _{4}=\frac{52 !}{4 ! 48 !}=\frac{49 \times 50 \times 51 \times 52}{2 \times 3 \times 4}$
$=270725$
There are $26$ red cards and $26$ black cards. Therefore, the required number of ways $=^{26} C _{2} \times^{26} C _{2}$
$=\left(\frac{26 !}{2 ! 24 !}\right)^{2}=(325)^{2}=105625$
Similar Questions
The number of ways in which any four letters can be selected from the word ‘$CORGOO$’ is
The number of ways in which any four letters can be selected from the word ‘$CORGOO$’ is
The number of ways, $16$ identical cubes, of which $11$ are blue and rest are red, can be placed in a row so that between any two red cubes there should be at least $2$ blue cubes, is
The number of ways, $16$ identical cubes, of which $11$ are blue and rest are red, can be placed in a row so that between any two red cubes there should be at least $2$ blue cubes, is
- [JEE MAIN 2022]
The value of ${}^{50}{C_4} + \sum\limits_{r = 1}^6 {^{56 - r}{C_3}} $ is
The value of ${}^{50}{C_4} + \sum\limits_{r = 1}^6 {^{56 - r}{C_3}} $ is
- [AIEEE 2005]
${ }^{n-1} C_r=\left(k^2-8\right){ }^n C_{r+1}$ if and only if:
${ }^{n-1} C_r=\left(k^2-8\right){ }^n C_{r+1}$ if and only if:
- [JEE MAIN 2024]
If $x,\;y$ and $r$ are positive integers, then $^x{C_r}{ + ^x}{C_{r - 1}}^y{C_1}{ + ^x}{C_{r - 2}}^y{C_2} + .......{ + ^y}{C_r} = $
If $x,\;y$ and $r$ are positive integers, then $^x{C_r}{ + ^x}{C_{r - 1}}^y{C_1}{ + ^x}{C_{r - 2}}^y{C_2} + .......{ + ^y}{C_r} = $