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

Exercise 13.1 · Q11: Die with E={1,3,5}E = \{1,3,5\}⁠, F={2,3}F = \{2,3\}⁠, G={2,3,4,5}G = \{2,3,4,5\}⁠: six conditional probabilities

Exercise 13.1Conditional probability · Section 13.2
The question

A fair die is rolled. Consider events E={1,3,5}E = \{1, 3, 5\}⁠, F={2,3}F = \{2, 3\} and G={2,3,4,5}G = \{2, 3, 4, 5\}⁠. Find

(i) P(E∣F)P(E|F) and P(F∣E)P(F|E)    (ii) P(E∣G)P(E|G) and P(G∣E)P(G|E)

(iii) P((E∪F)∣G)P((E\cup F)|G) and P((E∩F)∣G)P((E\cap F)|G)

Exam answer

Here S={1,2,3,4,5,6}S = \{1, 2, 3, 4, 5, 6\}⁠, and each outcome has probability 16\frac{1}{6} since the die is fair. So P(E)=36P(E) = \frac{3}{6}⁠, P(F)=26P(F) = \frac{2}{6} and P(G)=46P(G) = \frac{4}{6}⁠.

By the definition of conditional probability:

(i) E∩F={3}E\cap F = \{3\}⁠, so P(E∩F)=16P(E\cap F) = \frac{1}{6}⁠.

P(E∣F)=P(E∩F)P(F)=16÷26\begin{aligned} P(E|F) &= \frac{P(E\cap F)}{P(F)} \\ &= \frac{1}{6}\div\frac{2}{6} \end{aligned} P(F∣E)=P(E∩F)P(E)=16÷36\begin{aligned} P(F|E) &= \frac{P(E\cap F)}{P(E)} \\ &= \frac{1}{6}\div\frac{3}{6} \end{aligned}

P(E∣F)=12P(E|F) = \frac{1}{2}⁠, P(F∣E)=13P(F|E) = \frac{1}{3}⁠.

(ii) E∩G={3,5}E\cap G = \{3, 5\}⁠, so P(E∩G)=26P(E\cap G) = \frac{2}{6}⁠.

P(E∣G)=P(E∩G)P(G)=26÷46\begin{aligned} P(E|G) &= \frac{P(E\cap G)}{P(G)} \\ &= \frac{2}{6}\div\frac{4}{6} \end{aligned} P(G∣E)=P(E∩G)P(E)=26÷36\begin{aligned} P(G|E) &= \frac{P(E\cap G)}{P(E)} \\ &= \frac{2}{6}\div\frac{3}{6} \end{aligned}

P(E∣G)=12P(E|G) = \frac{1}{2}⁠, P(G∣E)=23P(G|E) = \frac{2}{3}⁠.

(iii) E∪F={1,2,3,5}E\cup F = \{1, 2, 3, 5\}⁠, so (E∪F)∩G={2,3,5}(E\cup F)\cap G = \{2, 3, 5\} and P((E∪F)∩G)=36P((E\cup F)\cap G) = \frac{3}{6}⁠.

P((E∪F)∣G)=P((E∪F)∩G)P(G)=36÷46\begin{aligned} &P((E\cup F)|G) \\ &= \frac{P((E\cup F)\cap G)}{P(G)} \\ &= \frac{3}{6}\div\frac{4}{6} \end{aligned}

Also E∩F={3}E\cap F = \{3\}⁠, so (E∩F)∩G={3}(E\cap F)\cap G = \{3\} and P((E∩F)∩G)=16P((E\cap F)\cap G) = \frac{1}{6}⁠.

P((E∩F)∣G)=P((E∩F)∩G)P(G)=16÷46\begin{aligned} &P((E\cap F)|G) \\ &= \frac{P((E\cap F)\cap G)}{P(G)} \\ &= \frac{1}{6}\div\frac{4}{6} \end{aligned}

∴ P((E∪F)∣G)=34\therefore\ P((E\cup F)|G) = \dfrac{3}{4} and P((E∩F)∣G)=14P((E\cap F)|G) = \dfrac{1}{4}⁠.

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

The one idea this problem is built on

All six faces are equally likely, so every conditional probability is a count: P(A∣B)=n(A∩B)n(B)P(A|B) = \dfrac{n(A\cap B)}{n(B)}⁠. The event after the bar is the new sample space; we count how many of its faces also lie in the event before the bar. The order matters: P(E∣F)P(E|F) and P(F∣E)P(F|E) divide by different events.

Given, to find, and the plan
Given
One roll of a fair die: S={1,2,3,4,5,6}S = \{1, 2, 3, 4, 5, 6\}⁠, each face with probability 16\frac16⁠. Events E={1,3,5}E = \{1, 3, 5\} (an odd number), F={2,3}F = \{2, 3\}⁠, G={2,3,4,5}G = \{2, 3, 4, 5\}⁠.
To find
(i) P(E∣F)P(E|F)⁠, P(F∣E)P(F|E)⁠; (ii) P(E∣G)P(E|G)⁠, P(G∣E)P(G|E)⁠; (iii) P((E∪F)∣G)P((E\cup F)|G)⁠, P((E∩F)∣G)P((E\cap F)|G)⁠.
Plan
Find P(E)P(E)⁠, P(F)P(F)⁠, P(G)P(G)⁠. For each part, find the needed intersection as a set, then divide by the probability of the event after the bar. Check (iii) with Property 2 of conditional probability.

Basics you need

1Union and intersection of sets

A∪BA\cup B⁠: the faces in AA or BB (or both); A∩BA\cap B⁠: the faces in both. Basics: events as sets

2Classical probability

With equally likely outcomes, P(A)=n(A)n(S)P(A) = \frac{n(A)}{n(S)}⁠; here n(S)=6n(S) = 6⁠. Basics: P(E) = n(E)/n(S)

3Conditional probability

P(A∣B)=P(A∩B)P(B)P(A|B) = \dfrac{P(A\cap B)}{P(B)}⁠, provided P(B)≠0P(B) \ne 0 (Definition 1, Section 13.2). Lesson: conditional probability

4Property 2 of conditional probability

P((A∪B)∣F)P((A\cup B)|F) =P(A∣F)+P(B∣F)= P(A|F) + P(B|F) − P((A∩B)∣F)-\, P((A\cap B)|F)⁠, the addition rule inside the new sample space FF (Section 13.2.1). Basics: add, but do not count the overlap twice

Part (i): P(E∣F)P(E|F) and P(F∣E)P(F|E)

  1. The probabilities of EE⁠, FF⁠, GG

    P(E)=36,P(F)=26,P(G)=46.P(E) = \frac{3}{6},\quad P(F) = \frac{2}{6},\quad P(G) = \frac{4}{6}.
    EE has 3 faces, FF has 2 and GG has 4, each face with probability 16\frac16⁠. None of them is 0, so every conditional probability asked for is defined. We keep the sixths uncancelled; they cancel in each division.
    Classical probability. Basics: P(E) = n(E)/n(S)
    E = {1, 3, 5} → 2 of 4 faces of G E 1 2 3 4 5 6 F = {2, 3} → 2 of 4 faces of G F 1 2 3 4 5 6 E ∪ F = {1, 2, 3, 5} → 3 of 4 faces of G E ∪ F 1 2 3 4 5 6 E ∩ F = {3} → 1 of 4 faces of G E ∩ F 1 2 3 4 5 6 event and G G only event only neither
    The six faces, once for each of EE⁠, FF⁠, E∪FE\cup F and E∩FE\cap F⁠, coloured against G={2,3,4,5}G = \{2, 3, 4, 5\}⁠. Blue and gold faces make up GG⁠, the new sample space of parts (ii) and (iii); the blue ones are also in the event of that row. So P(E∣G)=24P(E|G) = \frac24⁠, P((E∪F)∣G)=34P((E\cup F)|G) = \frac34 and P((E∩F)∣G)=14P((E\cap F)|G) = \frac14⁠.
  2. Intersect and divide both ways

    E∩F={3}E\cap F = \{3\}⁠, the only odd number in FF⁠, so P(E∩F)=16P(E\cap F) = \frac{1}{6}⁠.

    P(E∣F)=P(E∩F)P(F)=1/62/6=12,P(E|F) = \frac{P(E\cap F)}{P(F)} = \frac{1/6}{2/6} = \frac{1}{2}, P(F∣E)=P(E∩F)P(E)=1/63/6=13.P(F|E) = \frac{P(E\cap F)}{P(E)} = \frac{1/6}{3/6} = \frac{1}{3}.
    Both use the same top, P(E∩F)=P(F∩E)P(E\cap F) = P(F\cap E)⁠, but different bottoms. Given FF⁠, the world is {2,3}\{2, 3\} and 1 of its 2 faces is odd. Given EE⁠, the world is {1,3,5}\{1, 3, 5\} and 1 of its 3 faces is in FF⁠.
    Definition 1, Section 13.2. Lesson: conditional probability

Part (ii): P(E∣G)P(E|G) and P(G∣E)P(G|E)

  1. Intersect and divide both ways

    E∩G={3,5}E\cap G = \{3, 5\}⁠, so P(E∩G)=26P(E\cap G) = \frac{2}{6}⁠.

    P(E∣G)=P(E∩G)P(G)=2/64/6=12,P(E|G) = \frac{P(E\cap G)}{P(G)} = \frac{2/6}{4/6} = \frac{1}{2}, P(G∣E)=P(E∩G)P(E)=2/63/6=23.P(G|E) = \frac{P(E\cap G)}{P(E)} = \frac{2/6}{3/6} = \frac{2}{3}.
    The odd faces 1, 3, 5 that are also in {2,3,4,5}\{2, 3, 4, 5\} are 3 and 5. Given GG⁠, 2 of its 4 faces are odd; given EE⁠, 2 of its 3 faces are in GG⁠.
    Definition 1, Section 13.2. Lesson: conditional probability

Part (iii): P((E∪F)∣G)P((E\cup F)|G) and P((E∩F)∣G)P((E\cap F)|G)

  1. The union and the intersection, cut down to GG

    E∪F={1,2,3,5},(E∪F)∩G={2,3,5},E∩F={3},(E∩F)∩G={3}.\begin{aligned} E\cup F &= \{1, 2, 3, 5\}, \\ (E\cup F)\cap G &= \{2, 3, 5\}, \\ E\cap F &= \{3\}, \\ (E\cap F)\cap G &= \{3\}. \end{aligned}
    E∪FE\cup F collects every face of EE or FF⁠: 1, 3, 5 and 2, 3, with 3 written once. Of these, 1 is not in GG⁠. The single face of E∩FE\cap F⁠, 3, is in GG⁠.
    Union and intersection of sets. Basics: events as sets
  2. Divide by P(G)P(G)

    P((E∪F)∣G)=P((E∪F)∩G)P(G)=3/64/6=34,P((E∩F)∣G)=P((E∩F)∩G)P(G)=1/64/6=14.\begin{aligned} P((E\cup F)|G) &= \frac{P((E\cup F)\cap G)}{P(G)} \\ &= \frac{3/6}{4/6} = \frac{3}{4}, \\ P((E\cap F)|G) &= \frac{P((E\cap F)\cap G)}{P(G)} \\ &= \frac{1/6}{4/6} = \frac{1}{4}. \end{aligned}
    The definition works for any event before the bar, including a union or an intersection: intersect it with GG⁠, then divide by P(G)=46P(G) = \frac46⁠. In counts: 3 of the 4 faces of GG are in E∪FE\cup F⁠, and 1 of them is in E∩FE\cap F⁠.
    Definition 1, Section 13.2. Lesson: conditional probability
  3. Check the first answer with Property 2

    Here F∩G={2,3}F\cap G = \{2, 3\}⁠, so P(F∣G)=2/64/6=12P(F|G) = \frac{2/6}{4/6} = \frac{1}{2}⁠. Then

    P(E∣G)+P(F∣G)−P((E∩F)∣G)=12+12−14=34,\begin{aligned} &P(E|G) + P(F|G) - P((E\cap F)|G) \\ &= \frac{1}{2} + \frac{1}{2} - \frac{1}{4} = \frac{3}{4}, \end{aligned}

    which is P((E∪F)∣G)P((E\cup F)|G)⁠, as found above.

    Property 2 is the addition rule used inside the world GG⁠. Adding P(E∣G)P(E|G) and P(F∣G)P(F|G) counts face 3 twice, so its share P((E∩F)∣G)=14P((E\cap F)|G) = \frac14 is taken off once.
Result

(i) P(E∣F)=12P(E|F) = \frac{1}{2}⁠, P(F∣E)=13P(F|E) = \frac{1}{3}   (ii) P(E∣G)=12P(E|G) = \frac{1}{2}⁠, P(G∣E)=23P(G|E) = \frac{2}{3}   (iii) P((E∪F)∣G)=34P((E\cup F)|G) = \frac{3}{4}⁠, P((E∩F)∣G)=14P((E\cap F)|G) = \frac{1}{4}⁠.

(Textbook answer: (i) 12\frac12⁠, 13\frac13 (ii) 12\frac12⁠, 23\frac23 (iii) 34\frac34⁠, 14\frac14⁠.)

Check it with numbers

Count faces directly. (i) In {2,3}\{2, 3\}⁠, 1 of 2 is odd: 0.5; in {1,3,5}\{1, 3, 5\}⁠, 1 of 3 is in FF⁠: 13≈0.3333\frac13 \approx 0.3333⁠. (ii) In {2,3,4,5}\{2, 3, 4, 5\}⁠, 2 of 4 are odd: 0.5; in {1,3,5}\{1, 3, 5\}⁠, 2 of 3 are in GG⁠: 23≈0.6667\frac23 \approx 0.6667⁠. (iii) In {2,3,4,5}\{2, 3, 4, 5\}⁠, 3 of 4 are in {1,2,3,5}\{1, 2, 3, 5\}⁠: 0.75; and 1 of 4 is 3: 0.25.

A curious detail: P(E)=36=0.5P(E) = \frac36 = 0.5⁠, and also P(E∣F)=P(E∣G)=0.5P(E|F) = P(E|G) = 0.5⁠. Knowing FF or GG leaves the chance of an odd number unchanged; Section 13.4 calls such events independent.

Common mistakes
  1. Swapping the order. P(E∣F)P(E|F) divides by P(F)P(F)⁠, P(F∣E)P(F|E) by P(E)P(E)⁠. They are different here: 12\frac12 and 13\frac13⁠.
  2. Forgetting to intersect with GG in (iii). P(E∪F)=46P(E\cup F) = \frac46⁠, but face 1 is outside GG⁠, so the top is P((E∪F)∩G)=36P((E\cup F)\cap G) = \frac36⁠.
  3. Writing face 3 twice in E∪FE\cup F⁠. A union lists each face once, so n(E∪F)=4n(E\cup F) = 4⁠, not 5.
  4. Dividing by 6. n(E∩F)6\frac{n(E\cap F)}{6} is P(E∩F)P(E\cap F)⁠, not a conditional probability.
What to take away
  1. P(A∣B)=n(A∩B)n(B)P(A|B) = \dfrac{n(A\cap B)}{n(B)} for equally likely outcomes: the event after the bar is the new sample space.
  2. The definition works for any event before the bar; for a union, Property 2 gives the same answer as direct counting.

Every fact used, and where it comes from

FactUsed inSource
A fair die: 6 equally likely faces, P(A)=n(A)6P(A) = \frac{n(A)}{6}All partsClass XI, Probability (Basics: classical probability)
Union and intersection of setsPart (iii)Class XI, Sets (Basics: events as sets)
P(A∣B)=P(A∩B)P(B)P(A|B) = \frac{P(A\cap B)}{P(B)}⁠, P(B)≠0P(B) \ne 0All partsSection 13.2, Definition 1 (Lesson: conditional probability)
P((A∪B)∣F)P((A\cup B)|F) =P(A∣F)+P(B∣F)= P(A|F) + P(B|F) − P((A∩B)∣F)-\, P((A\cap B)|F)Part (iii), checkSection 13.2.1, Property 2
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 →