Skip to content
Exercise 14.1 · Q5

Q.Three coins are tossed. Describe

(i) Two events which are mutually exclusive.
(ii) Three events which are mutually exclusive and exhaustive.
(iii) Two events, which are not mutually exclusive.
(iv) Two events which are mutually exclusive but not exhaustive.
(v) Three events which are mutually exclusive but not exhaustive.
Meghalaya MboseTextbookSubjective· 3mImportance★★★★★
9% · 8/93 Questions
🔒 Locked · start free trial →

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 →

The key idea is to use the sample space of 8 outcomes from tossing three coins and apply set operations to construct events that satisfy the given conditions. The final answers are specific subsets of the sample space.

When three coins are tossed, each coin can land either heads (H) or tails (T). The total number of possible outcomes is 23=82^3 = 8. The sample space SS is:

S={HHH,HHT,HTH,HTT,THH,THT,TTH,TTT}S = \{HHH, HHT, HTH, HTT, THH, THT, TTH, TTT\}

An event is any subset of SS. Two events are mutually exclusive if they have no outcome in common — their intersection is empty. Events are exhaustive if their union equals the entire sample space SS. If they are not exhaustive, their union is a proper subset of SS.

Let’s construct each required set step by step.

  1. Two events which are mutually exclusive

    Pick any two events that cannot happen together. For instance, let

    A={all heads}={HHH}A = \{\text{all heads}\} = \{HHH\} and

    B={all tails}={TTT}B = \{\text{all tails}\} = \{TTT\}.

    Since A∩B=∅A \cap B = \varnothing, they are mutually exclusive. They are not exhaustive because many outcomes (like HHT) are in neither.

  2. Three events which are mutually exclusive and exhaustive

    We need three disjoint events whose union is SS. A natural way is to group outcomes by the number of heads:

    • E0={0 heads}={TTT}E_0 = \{\text{0 heads}\} = \{TTT\}
    • E1={exactly 1 head}={HTT,THT,TTH}E_1 = \{\text{exactly 1 head}\} = \{HTT, THT, TTH\}
    • E2={exactly 2 heads}={HHT,HTH,THH}E_2 = \{\text{exactly 2 heads}\} = \{HHT, HTH, THH\}
    • E3={exactly 3 heads}={HHH}E_3 = \{\text{exactly 3 heads}\} = \{HHH\} But that gives four events. To have exactly three, combine two of them. For example, let:
    • X={0 or 1 head}={TTT,HTT,THT,TTH}X = \{\text{0 or 1 head}\} = \{TTT, HTT, THT, TTH\}
    • Y={exactly 2 heads}={HHT,HTH,THH}Y = \{\text{exactly 2 heads}\} = \{HHT, HTH, THH\}
    • Z={exactly 3 heads}={HHH}Z = \{\text{exactly 3 heads}\} = \{HHH\} Check: X∩Y=∅X \cap Y = \varnothing, X∩Z=∅X \cap Z = \varnothing, Y∩Z=∅Y \cap Z = \varnothing, and X∪Y∪Z=SX \cup Y \cup Z = S. So these three are mutually exclusive and exhaustive.
  3. Two events which are not mutually exclusive

    They must share at least one outcome. Let

    P={first coin is H}={HHH,HHT,HTH,HTT}P = \{\text{first coin is H}\} = \{HHH, HHT, HTH, HTT\} and

    Q={second coin is H}={HHH,HHT,THH,THT}Q = \{\text{second coin is H}\} = \{HHH, HHT, THH, THT\}.

    Their intersection P∩Q={HHH,HHT}P \cap Q = \{HHH, HHT\} is non-empty, so they are not mutually exclusive.

  4. Two events which are mutually exclusive but not exhaustive

    They must be disjoint, but their union should miss at least one outcome. Take

    R={exactly 2 heads}={HHT,HTH,THH}R = \{\text{exactly 2 heads}\} = \{HHT, HTH, THH\} and

    S={exactly 0 heads}={TTT}S = \{\text{exactly 0 heads}\} = \{TTT\}.

    R∩S=∅R \cap S = \varnothing, so mutually exclusive. Their union {HHT,HTH,THH,TTT}\{HHT, HTH, THH, TTT\} does not include outcomes like HHH or HTT, so not exhaustive.

  5. Three events which are mutually exclusive but not exhaustive

    We need three pairwise disjoint events whose union is a proper subset of SS. For instance:

    • U={first coin H, second H}={HHH,HHT}U = \{\text{first coin H, second H}\} = \{HHH, HHT\}
    • V={first coin T, second T}={TTH,TTT}V = \{\text{first coin T, second T}\} = \{TTH, TTT\} …

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.