Exercise 13.3 · Q12: Lost card is a diamond, given two diamonds are drawn,
A card from a pack of 52 cards is lost. From the remaining cards of the pack, two cards are drawn and are found to be both diamonds. Find the probability of the lost card being a diamond.
Let : the lost card is a diamond, : the lost card is not a diamond, and : the two cards drawn are both diamonds.
and form a partition of the sample space (the lost card either is a diamond or is not).
and
Here , and .
If occurs, 51 cards remain and 12 of them are diamonds, so
If occurs, 51 cards remain and 13 of them are diamonds, so
By the theorem of total probability,
By Bayes' theorem,
The probability that the lost card is a diamond is (dividing by 2).
Want the reason behind every step, the basics and the checks?
The lost card changes the pack that the two cards are drawn from. If a diamond was lost, only 12 diamonds remain; if not, all 13 remain, so two diamonds are a little more likely. Seeing two diamonds is therefore weak evidence against a lost diamond. Split by the lost card, count with combinations in each case, and let Bayes' theorem turn the question round.
- Given
- A pack of 52 cards (13 diamonds). One card is lost at random. Two cards are drawn at random from the other 51, and both are diamonds.
- To find
- The probability that the lost card is a diamond: .
- Plan
- (1) Name the events; check the partition. (2) , . (3) , by combinations. (4) Total probability. (5) Bayes' theorem.
Basics you need
52 cards in 4 suits of 13: diamonds, hearts, clubs and spades. So 13 cards are diamonds and 39 are not. Basics: classical probability
The number of ways to choose 2 cards from is ; the order of the two cards does not matter. Basics: multiply the choices
is the chance of two diamonds when we know the 51 remaining cards hold 12 diamonds. Lesson: conditional probability
For a partition : and . Lesson: Bayes' theorem
Solution
Name the events
Let
- : the lost card is a diamond;
- : the lost card is not a diamond;
- : the two cards drawn are both diamonds.
and form a partition of the sample space: an event and its complement never happen together, one of them always happens, and both are possible.
The lost card is the hidden cause; the two diamonds are the result we observe. Section 13.5.1 notes that an event and its complement form a partition; the condition "nonzero probabilities" holds here, since and (Step 2).Partition: pairwise disjoint, exhaustive, nonzero probabilities (Section 13.5.1). Lesson: Bayes' theoremThe chances for the lost card
The lost card is equally likely to be any of the 52 cards, and 13 of them are diamonds.for equally likely outcomes. Basics: classical probabilityTwo diamonds in each case
In both cases 51 cards remain, and the number of ways to draw 2 of them is .
If a diamond was lost (), 12 diamonds remain, and there are ways to draw two of them:
If the lost card was not a diamond (), all 13 diamonds remain, and there are ways:
Every pair of the 51 remaining cards is equally likely to be drawn, so the chance of two diamonds is the number of diamond pairs over the number of all pairs. Both fractions simplify by dividing by 3. The same values come from the multiplication rule, one card after the other: .counts the pairs. Basics: multiply the choicesThe chance of two diamonds
Since and form a partition, by the theorem of total probability
The tree for Question 12. The rose path (a diamond lost, then two diamonds drawn) has product ; the green path (another card lost, then two diamonds) has . Together, . Two diamonds are drawn after exactly one kind of lost card, so the two path probabilities add. As a check, , which is : the lost card is unseen, so the two drawn cards behave like two cards from a full pack.Multiply along a path, add the paths. Basics: tree diagramsLost card a diamond, given two diamonds: Bayes' theorem
By Bayes' theorem,
The top is the "diamond lost" path to two diamonds; the bottom is both paths. The 1700s cancel, and dividing the top and the bottom of by 2 gives .Dividing by a fraction is multiplying by its flip. Basics: dividing by a fractionA quick sense check
For the other case, , and .
The answer has a neat meaning. Once two diamonds are seen, 50 cards are unseen: the lost card and the 49 left in the pack. Of these, are diamonds, and the lost card is just as likely to be any of the 50. So the chance is , a little less than the we started with.
Given two diamonds, the lost card either is or is not a diamond, so the two updated probabilities must add to 1. The 50-card argument works because nothing distinguishes the lost card from the cards still in the pack.The posterior probabilities of a partition add to 1. Lesson: Bayes' theorem
The probability that the lost card is a diamond is . (Textbook answer: .)
List every way it can happen: 52 choices of lost card, then pairs, so equally likely outcomes. Two diamonds are drawn in of them with a lost diamond and in with another lost card. So outcomes show two diamonds, and , the same as . The verify script makes this list and counts it.
- Answering . That is , before the two diamonds are seen; the drawn diamonds make a lost diamond a little less likely.
- Using 52 cards for the draw. The two cards come from the 51 that remain after one is lost.
- Using 13 diamonds in both cases. If a diamond was lost, only 12 diamonds remain.
- Using . The cards are drawn without replacement, so the second factor is out of 50: .
- A hidden first step (a lost card, a moved ball) changes the counts for the second step; split by the hidden step and count again in each case.
- For draws without replacement, and give the same value.
- An unseen card is like any other unseen card: here the lost card has the same chance of being a diamond as each of the 49 cards still in the pack.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Partition of a sample space; an event and its complement | Step 1 | Section 13.5.1 (Lesson: Bayes' theorem) |
| for equally likely outcomes | Steps 2, 3 | Classical probability, Class XI (Basics: classical probability) |
| Step 3 | Combinations, Class XI (Basics: multiply the choices) | |
| Multiplication rule for draws without replacement | Steps 3, 4 | Section 13.3 (Lesson: the multiplication rule) |
| Theorem of total probability | Step 4 | Section 13.5.2 (Lesson: Bayes' theorem) |
| Bayes' theorem | Steps 5, 6 | Section 13.5 (Examples 15 to 21) |
Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →