Class 12 Maths, Worked in Full Past papersGet updates
Chapter 13 · Probability

Exercise 13.3 · Q12: Lost card is a diamond, given two diamonds are drawn, P=1150P = \frac{11}{50}

Exercise 13.3Bayes' theorem · Section 13.5
The question

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.

Exam answer

Let E1E_1⁠: the lost card is a diamond, E2E_2⁠: the lost card is not a diamond, and AA⁠: the two cards drawn are both diamonds.

E1E_1 and E2E_2 form a partition of the sample space (the lost card either is a diamond or is not).

P(E1)=1352=14P(E_1) = \frac{13}{52} = \frac14 and P(E2)=3952=34P(E_2) = \frac{39}{52} = \frac34

Here 12C2=66{}^{12}C_2 = 66⁠, 13C2=78{}^{13}C_2 = 78 and 51C2=1275{}^{51}C_2 = 1275⁠.

If E1E_1 occurs, 51 cards remain and 12 of them are diamonds, so

P(A∣E1)=12C251C2=661275=22425\begin{aligned} P(A|E_1) &= \frac{{}^{12}C_2}{{}^{51}C_2} = \frac{66}{1275} \\ &= \frac{22}{425} \end{aligned}

If E2E_2 occurs, 51 cards remain and 13 of them are diamonds, so

P(A∣E2)=13C251C2=781275=26425\begin{aligned} P(A|E_2) &= \frac{{}^{13}C_2}{{}^{51}C_2} = \frac{78}{1275} \\ &= \frac{26}{425} \end{aligned}

By the theorem of total probability,

P(A)=P(E1)P(A∣E1)+P(E2)P(A∣E2)=14⋅22425+34⋅26425=221700+781700=1001700\begin{aligned} P(A) &= P(E_1)P(A|E_1) \\ &\quad + P(E_2)P(A|E_2) \\ &= \frac14\cdot\frac{22}{425} + \frac34\cdot\frac{26}{425} \\ &= \frac{22}{1700} + \frac{78}{1700} \\ &= \frac{100}{1700} \end{aligned}

By Bayes' theorem,

P(E1∣A)=P(E1)P(A∣E1)P(A)=221700÷1001700=221700×1700100\begin{aligned} P(E_1|A) &= \frac{P(E_1)P(A|E_1)}{P(A)} \\ &= \frac{22}{1700} \div \frac{100}{1700} \\ &= \frac{22}{1700} \times \frac{1700}{100} \end{aligned}

∴\therefore The probability that the lost card is a diamond is 22100=1150\dfrac{22}{100} = \dfrac{11}{50} (dividing by 2).

Want the reason behind every step, the basics and the checks?

The one idea this problem is built on

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, to find, and the plan
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: P(E1∣A)P(E_1|A)⁠.
Plan
(1) Name the events; check the partition. (2) P(E1)P(E_1)⁠, P(E2)P(E_2)⁠. (3) P(A∣E1)P(A|E_1)⁠, P(A∣E2)P(A|E_2) by combinations. (4) Total probability. (5) Bayes' theorem.

Basics you need

1A pack of cards

52 cards in 4 suits of 13: diamonds, hearts, clubs and spades. So 13 cards are diamonds and 39 are not. Basics: classical probability

2Combinations (Class XI)

The number of ways to choose 2 cards from nn is nC2=n(n−1)2{}^{n}C_2 = \frac{n(n - 1)}{2}⁠; the order of the two cards does not matter. Basics: multiply the choices

3Conditional probability (Section 13.2)

P(A∣E1)P(A|E_1) is the chance of two diamonds when we know the 51 remaining cards hold 12 diamonds. Lesson: conditional probability

4Total probability and Bayes' theorem (Section 13.5)

For a partition E1,E2E_1, E_2⁠: P(A)=∑P(Ei)P(A∣Ei)P(A) = \sum P(E_i)P(A|E_i) and P(E1∣A)=P(E1)P(A∣E1)P(A)P(E_1|A) = \frac{P(E_1)P(A|E_1)}{P(A)}⁠. Lesson: Bayes' theorem

Solution

  1. Name the events

    Let

    • E1E_1⁠: the lost card is a diamond;
    • E2E_2⁠: the lost card is not a diamond;
    • AA⁠: the two cards drawn are both diamonds.

    E1E_1 and E2E_2 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 P(E1)=14P(E_1) = \frac14 and P(E2)=34P(E_2) = \frac34 (Step 2).
    Partition: pairwise disjoint, exhaustive, nonzero probabilities (Section 13.5.1). Lesson: Bayes' theorem
  2. The chances for the lost card

    P(E1)=1352=14,P(E2)=3952=34.\begin{aligned} P(E_1) &= \frac{13}{52} = \frac14, \\ P(E_2) &= \frac{39}{52} = \frac34. \end{aligned}
    The lost card is equally likely to be any of the 52 cards, and 13 of them are diamonds.
    P(E)=n(E)n(S)P(E) = \frac{n(E)}{n(S)} for equally likely outcomes. Basics: classical probability
  3. Two diamonds in each case

    In both cases 51 cards remain, and the number of ways to draw 2 of them is 51C2=51×502=1275{}^{51}C_2 = \frac{51 \times 50}{2} = 1275⁠.

    If a diamond was lost (E1E_1⁠), 12 diamonds remain, and there are 12C2=12×112=66{}^{12}C_2 = \frac{12 \times 11}{2} = 66 ways to draw two of them:

    P(A∣E1)=12C251C2=661275=22425.P(A|E_1) = \frac{{}^{12}C_2}{{}^{51}C_2} = \frac{66}{1275} = \frac{22}{425}.

    If the lost card was not a diamond (E2E_2⁠), all 13 diamonds remain, and there are 13C2=13×122=78{}^{13}C_2 = \frac{13 \times 12}{2} = 78 ways:

    P(A∣E2)=13C251C2=781275=26425.P(A|E_2) = \frac{{}^{13}C_2}{{}^{51}C_2} = \frac{78}{1275} = \frac{26}{425}.
    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: 1251×1150=1322550=22425\frac{12}{51} \times \frac{11}{50} = \frac{132}{2550} = \frac{22}{425}⁠.
    nC2=n(n−1)2{}^{n}C_2 = \frac{n(n - 1)}{2} counts the pairs. Basics: multiply the choices
  4. The chance of two diamonds

    Since E1E_1 and E2E_2 form a partition, by the theorem of total probability

    P(A)=P(E1)P(A∣E1)+P(E2)P(A∣E2)=14⋅22425+34⋅26425=221700+781700=1001700.\begin{aligned} P(A) &= P(E_1)P(A|E_1) \\ &\quad + P(E_2)P(A|E_2) \\ &= \frac14\cdot\frac{22}{425} + \frac34\cdot\frac{26}{425} \\ &= \frac{22}{1700} + \frac{78}{1700} = \frac{100}{1700}. \end{aligned}
    start lost card two cards drawn multiply along the path pack E₁: diamond A: both ♦ 1/4 × 22/425 = 22/1700 A′: not both 1/4 × 403/425 E₂: not diamond A: both ♦ 3/4 × 26/425 = 78/1700 A′: not both 3/4 × 399/425 1/4 22/425 403/425 3/4 26/425 399/425
    The tree for Question 12. The rose path (a diamond lost, then two diamonds drawn) has product 221700\frac{22}{1700}⁠; the green path (another card lost, then two diamonds) has 781700\frac{78}{1700}⁠. Together, P(A)=1001700P(A) = \frac{100}{1700}⁠.
    Two diamonds are drawn after exactly one kind of lost card, so the two path probabilities add. As a check, 1001700=117\frac{100}{1700} = \frac{1}{17}⁠, which is 1352×1251\frac{13}{52} \times \frac{12}{51}⁠: 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 diagrams
  5. Lost card a diamond, given two diamonds: Bayes' theorem

    By Bayes' theorem,

    P(E1∣A)=P(E1)P(A∣E1)P(A)=221700÷1001700=221700×1700100=22100=1150.\begin{aligned} P(E_1|A) &= \frac{P(E_1)P(A|E_1)}{P(A)} \\ &= \frac{22}{1700} \div \frac{100}{1700} \\ &= \frac{22}{1700} \times \frac{1700}{100} \\ &= \frac{22}{100} = \frac{11}{50}. \end{aligned}
    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 22100\frac{22}{100} by 2 gives 1150\frac{11}{50}⁠.
    Dividing by a fraction is multiplying by its flip. Basics: dividing by a fraction
  6. A quick sense check

    For the other case, P(E2∣A)=78100=3950P(E_2|A) = \frac{78}{100} = \frac{39}{50}⁠, and 1150+3950=1\frac{11}{50} + \frac{39}{50} = 1⁠.

    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, 13−2=1113 - 2 = 11 are diamonds, and the lost card is just as likely to be any of the 50. So the chance is 1150\frac{11}{50}⁠, a little less than the 14\frac14 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
Result

The probability that the lost card is a diamond is 1150\frac{11}{50}⁠. (Textbook answer: 1150\frac{11}{50}⁠.)

Check it with numbers

List every way it can happen: 52 choices of lost card, then 51C2=1275{}^{51}C_2 = 1275 pairs, so 52×1275=6630052 \times 1275 = 66300 equally likely outcomes. Two diamonds are drawn in 13×66=85813 \times 66 = 858 of them with a lost diamond and in 39×78=304239 \times 78 = 3042 with another lost card. So 858+3042=3900858 + 3042 = 3900 outcomes show two diamonds, and 8583900=0.22\frac{858}{3900} = 0.22⁠, the same as 1150=0.22\frac{11}{50} = 0.22⁠. The verify script makes this list and counts it.

Common mistakes
  1. Answering 14\frac14⁠. That is P(E1)P(E_1)⁠, before the two diamonds are seen; the drawn diamonds make a lost diamond a little less likely.
  2. Using 52 cards for the draw. The two cards come from the 51 that remain after one is lost.
  3. Using 13 diamonds in both cases. If a diamond was lost, only 12 diamonds remain.
  4. Using 1351×1251\frac{13}{51} \times \frac{12}{51}⁠. The cards are drawn without replacement, so the second factor is out of 50: 1351×1250\frac{13}{51} \times \frac{12}{50}⁠.
What to take away
  1. 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.
  2. For draws without replacement, kC2nC2\frac{{}^{k}C_2}{{}^{n}C_2} and kn×k−1n−1\frac{k}{n} \times \frac{k - 1}{n - 1} give the same value.
  3. 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

FactUsed inSource
Partition of a sample space; an event and its complementStep 1Section 13.5.1 (Lesson: Bayes' theorem)
P(E)=n(E)n(S)P(E) = \frac{n(E)}{n(S)} for equally likely outcomesSteps 2, 3Classical probability, Class XI (Basics: classical probability)
nC2=n(n−1)2{}^{n}C_2 = \frac{n(n - 1)}{2}Step 3Combinations, Class XI (Basics: multiply the choices)
Multiplication rule for draws without replacementSteps 3, 4Section 13.3 (Lesson: the multiplication rule)
Theorem of total probabilityStep 4Section 13.5.2 (Lesson: Bayes' theorem)
Bayes' theoremSteps 5, 6Section 13.5 (Examples 15 to 21)
Found an error, or want more?

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 →