Q.While shuffling a pack of 52 playing cards, 2 are accidentally dropped. Find the probability that the missing cards to be of different colours
(A)
(B)
(C)
(D)
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →We use classical probability and combinations to find the probability of drawing two cards of different colours from a 52-card deck. The total number of ways to draw two cards is , and the number of ways to draw one red and one black card is . The probability is .
When dealing with probability problems like this, where we're selecting items from a group and the order of selection doesn't matter, the concept of classical probability combined with combinations is key.
Classical probability states that if all outcomes of an experiment are equally likely, the probability of an event occurring is given by the ratio:
In this problem, our "experiment" is accidentally dropping two cards from a shuffled deck. We want to find the probability that these two missing cards are of different colours.
Let's break this down step-by-step.
-
Understand the Deck Composition:
A standard deck of 52 playing cards consists of:
- 26 red cards (13 Hearts and 13 Diamonds)
- 26 black cards (13 Clubs and 13 Spades) The problem asks for cards of "different colours", meaning one red card and one black card.
-
Calculate the Total Number of Possible Outcomes:
This is the total number of ways to choose any 2 cards from the 52 cards in the deck. Since the order in which the cards are dropped doesn't matter, we use combinations.
The number of ways to choose items from a set of items is given by the combination formula: .
Here, (total cards) and (cards dropped).
So, there are 1326 different pairs of cards that could be dropped.
3. Calculate the Number of Favorable Outcomes:
We want the two missing cards to be of different colours. This means we need to choose one red card AND one black card.
* Number of ways to choose 1 red card from the 26 red cards:
* Number of ways to choose 1 black card from the 26 black cards:
$$C(26, 1) = \frac{26!}{1!(26-1)!} = \frac{26!}{1!25!} = 26$$ …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.