SOLVER7 Study. Nothing Else.
Exercise 14.1 Q5(ii)

Three coins are tossed. Describe : Three events which are mutually exclusive and exhaustive.

CBSE Class 11 Maths · Probability

Solution

👶 Simple Explanation

Simple Explanation

Imagine sorting 8 coins into three different boxes so that every coin goes into exactly one box and no box shares a coin with another. When three coins are tossed, there are 8 possible outcomes. We sort them by counting heads: zero heads in box A, one head in box B, and two or more heads in box C. Every outcome fits into one box only. Together, all three boxes hold every single outcome, leaving nothing out.

Answer: Take \( A = \{TTT\} \) (no head), \( B = \{HTT, THT, TTH\} \) (exactly one head), and \( C = \{HHT, HTH, THH, HHH\} \) (at least two heads). These three events satisfy \( A \cap B = B \cap C = A \cap C = \emptyset \) (mutually exclusive) and \( A \cup B \cup C = S \) (exhaustive).

📖 Mutually Exclusive and Exhaustive Events (Three Coins)

Detailed Explanation

When three coins are tossed, first we write the sample space, which lists every possible outcome. Using H for head and T for tail, the sample space is \( S = \{HHH, HHT, HTH, THH, HTT, THT, TTH, TTT\} \), so there are 8 equally likely outcomes. Two events are mutually exclusive if they have no outcome in common, that is, their intersection is empty. A collection of events is exhaustive if together they cover the entire sample space, that is, their union equals \( S \). So we need three events \( A, B, C \) such that no two share an outcome, and all three together give back every outcome of \( S \). A natural way to build such events is to classify outcomes by the number of heads they contain, since each outcome has exactly one 'number of heads' and every count from 0 to 3 is covered.

Formula Used

Mutually exclusive: \( A \cap B = \emptyset,\ B \cap C = \emptyset,\ A \cap C = \emptyset \). Exhaustive: \( A \cup B \cup C = S \).

Solution

  1. Step 1: Write the sample space for tossing three coins. Each coin gives H or T, so the total number of outcomes is \( 2 \times 2 \times 2 = 8 \). Thus \( S = \{HHH, HHT, HTH, THH, HTT, THT, TTH, TTT\} \).
  2. Step 2: Choose a way to split the outcomes so that each outcome falls into exactly one group. A clean choice is to group outcomes by the number of heads. Define the events: A = getting exactly no head, B = getting exactly one head, C = getting at least two heads.
  3. Step 3: List the outcomes in each event. \( A = \{TTT\} \) (zero heads). \( B = \{HTT, THT, TTH\} \) (exactly one head). \( C = \{HHT, HTH, THH, HHH\} \) (two or three heads).
  4. Step 4: Check mutually exclusive: no outcome appears in more than one event, so \( A \cap B = \emptyset \), \( B \cap C = \emptyset \), and \( A \cap C = \emptyset \). This is why grouping by number of heads works: an outcome cannot have both 'no head' and 'one head' at the same time.
  5. Step 5: Check exhaustive: combine all outcomes. \( A \cup B \cup C = \{TTT, HTT, THT, TTH, HHT, HTH, THH, HHH\} = S \). Since the union equals the full sample space, the events are exhaustive.

Final Answer

Take \( A = \{TTT\} \) (no head), \( B = \{HTT, THT, TTH\} \) (exactly one head), and \( C = \{HHT, HTH, THH, HHH\} \) (at least two heads). These three events satisfy \( A \cap B = B \cap C = A \cap C = \emptyset \) (mutually exclusive) and \( A \cup B \cup C = S \) (exhaustive).

Common Mistake

A common mistake is choosing events that overlap, such as 'at least one head' and 'exactly two heads', which share outcomes and are therefore not mutually exclusive. Always ensure each outcome belongs to only one event and that all 8 outcomes are covered.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: List every possible outcome when three coins are tossed. Since each coin independently shows H (head) or T (tail), the total number of outcomes is \( 2 \times 2 \times 2 = 8 \). The complete sample space is \[ S = \{HHH,\, HHT,\, HTH,\, THH,\, HTT,\, THT,\, TTH,\, TTT\} \] Reason: Writing out all outcomes ensures we do not miss any element when forming our events.
  2. Step 2: Decide on a rule to split the 8 outcomes into exactly three non-overlapping groups. A natural choice is to classify each outcome by how many heads it contains — every outcome carries a unique head-count, so no outcome can fall into two groups at once. The three categories will be: zero heads, exactly one head, and at least two heads. Reason: Grouping by head-count guarantees the groups are disjoint and together cover all outcomes.
  3. Step 3: Form event \( A \) = outcomes with exactly zero heads. Scanning the sample space, only one outcome has no head: \[ A = \{TTT\} \] Reason: Identifying this group first is easy since TTT is the only sequence with all tails.
  4. Step 4: Form event \( B \) = outcomes with exactly one head. The outcomes in which precisely one coin shows H are: \[ B = \{HTT,\, THT,\, TTH\} \] Reason: Exactly one position among the three carries an H; there are \( {}^{3}C_{1} = 3 \) such arrangements.
  5. Step 5: Form event \( C \) = outcomes with at least two heads (i.e., two or three heads). The remaining outcomes are: \[ C = \{HHT,\, HTH,\, THH,\, HHH\} \] Reason: Three outcomes have exactly two heads and one outcome has three heads, giving four elements in total — all outcomes not already placed in \( A \) or \( B \).
  6. Step 6: Verify the mutually exclusive condition by checking pairwise intersections. Since every outcome belongs to exactly one head-count group, no outcome can appear in two different events: \[ A \cap B = \emptyset, \quad B \cap C = \emptyset, \quad A \cap C = \emptyset \] Reason: Two events are mutually exclusive precisely when they share no common outcome.
  7. Step 7: Verify the exhaustive condition by checking the union of all three events: \[ A \cup B \cup C = \{TTT\} \cup \{HTT, THT, TTH\} \cup \{HHT, HTH, THH, HHH\} = S \] Since the union reproduces every element of \( S \), the three events together are exhaustive. Reason: A collection of events is exhaustive when it accounts for every possible outcome in the experiment.

Final Answer

Take \( A = \{TTT\} \) (no head), \( B = \{HTT, THT, TTH\} \) (exactly one head), and \( C = \{HHT, HTH, THH, HHH\} \) (at least two heads). These three events satisfy \( A \cap B = B \cap C = A \cap C = \emptyset \) (mutually exclusive) and \( A \cup B \cup C = S \) (exhaustive).

Common Mistake

One common mistake: students sometimes define events that overlap — for example, letting one event be 'at least one head' and another be 'at least two heads.' These two events share outcomes with two or three heads, so their intersection is not empty and the events are NOT mutually exclusive.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Sample space: \( S = \{HHH, HHT, HTH, THH, HTT, THT, TTH, TTT\} \), total \( 2 \times 2 \times 2 = 8 \) outcomes.
  2. Step 2: Partition by number of heads: \( A = \{TTT\} \), \( B = \{HTT, THT, TTH\} \), \( C = \{HHT, HTH, THH, HHH\} \).
  3. Step 3: Verify: \( A \cap B = B \cap C = A \cap C = \emptyset \) and \( A \cup B \cup C = S \).

Answer: Take \( A = \{TTT\} \) (no head), \( B = \{HTT, THT, TTH\} \) (exactly one head), and \( C = \{HHT, HTH, THH, HHH\} \) (at least two heads). These three events satisfy \( A \cap B = B \cap C = A \cap C = \emptyset \) (mutually exclusive) and \( A \cup B \cup C = S \) (exhaustive).

➕ More Examples

More Examples

Example 1

Question: A fair die is rolled once. The sample space is \( S = \{1, 2, 3, 4, 5, 6\} \). Define three events such that they are mutually exclusive and exhaustive. List the events explicitly and verify both properties.

Solution: The sample space when a die is rolled is \( S = \{1, 2, 3, 4, 5, 6\} \). Define the three events as follows: Event A: the outcome is less than or equal to 2, so \( A = \{1, 2\} \). Event B: the outcome is 3 or 4, so \( B = \{3, 4\} \). Event C: the outcome is greater than or equal to 5, so \( C = \{5, 6\} \). Verification of mutual exclusivity: Check \( A \cap B \): \( \{1,2\} \cap \{3,4\} = \emptyset \). Check \( B \cap C \): \( \{3,4\} \cap \{5,6\} = \emptyset \). Check \( A \cap C \): \( \{1,2\} \cap \{5,6\} = \emptyset \). Since all pairwise intersections are empty, the events are mutually exclusive. Verification of exhaustiveness: \[ A \cup B \cup C = \{1,2\} \cup \{3,4\} \cup \{5,6\} = \{1,2,3,4,5,6\} = S \] Since the union equals the entire sample space, the events are exhaustive. Therefore, A, B, and C are mutually exclusive and exhaustive events.

Answer: A = {1, 2}, B = {3, 4}, C = {5, 6}. These events are mutually exclusive (pairwise disjoint) and exhaustive (their union is S).

Example 2

Question: Two coins are tossed simultaneously. The sample space is \( S = \{HH, HT, TH, TT\} \). Describe three events that are mutually exclusive and exhaustive. Verify both properties.

Solution: The sample space when two coins are tossed is \( S = \{HH, HT, TH, TT\} \), which has 4 equally likely outcomes. Define the three events based on the number of heads obtained: Event A: exactly 2 heads appear, so \( A = \{HH\} \). Event B: exactly 1 head appears, so \( B = \{HT, TH\} \). Event C: no head appears (i.e., exactly 0 heads), so \( C = \{TT\} \). Verification of mutual exclusivity: Check \( A \cap B \): \( \{HH\} \cap \{HT, TH\} = \emptyset \). Check \( B \cap C \): \( \{HT, TH\} \cap \{TT\} = \emptyset \). Check \( A \cap C \): \( \{HH\} \cap \{TT\} = \emptyset \). All pairwise intersections are empty, so the events are mutually exclusive. Verification of exhaustiveness: \[ A \cup B \cup C = \{HH\} \cup \{HT, TH\} \cup \{TT\} = \{HH, HT, TH, TT\} = S \] The union of the three events equals the entire sample space S. Hence, A, B, and C are mutually exclusive and exhaustive events. Note: The probabilities also satisfy \( P(A) + P(B) + P(C) = \frac{1}{4} + \frac{2}{4} + \frac{1}{4} = 1 \), which is consistent with the events forming a partition of S.

Answer: A = {HH} (2 heads), B = {HT, TH} (1 head), C = {TT} (0 heads). These events are mutually exclusive and exhaustive, partitioning S completely.

🎯 Try a Similar Question

Try a Similar Question

Question: A fair die is rolled once. The sample space is \( S = \{1, 2, 3, 4, 5, 6\} \). Define three events based on the number obtained: event \( P \) — the number is less than 3, event \( Q \) — the number is either 3 or 4, and event \( R \) — the number is greater than 4. Show that \( P \), \( Q \), and \( R \) are mutually exclusive and exhaustive events.

Solution

  1. Step 1: Write the Sample Space: When a fair die is rolled, the sample space is \( S = \{1, 2, 3, 4, 5, 6\} \), containing 6 equally likely outcomes.
  2. Step 2: Define the Three Events: Event \( P \): the number obtained is less than 3, so \( P = \{1, 2\} \). Event \( Q \): the number obtained is 3 or 4, so \( Q = \{3, 4\} \). Event \( R \): the number obtained is greater than 4, so \( R = \{5, 6\} \).
  3. Step 3: Check Mutual Exclusivity: Two events are mutually exclusive if their intersection is empty. Check each pair: \( P \cap Q = \{1, 2\} \cap \{3, 4\} = \emptyset \). \( Q \cap R = \{3, 4\} \cap \{5, 6\} = \emptyset \). \( P \cap R = \{1, 2\} \cap \{5, 6\} = \emptyset \). Since all three pairwise intersections are empty, the events \( P \), \( Q \), and \( R \) are mutually exclusive.
  4. Step 4: Check Exhaustiveness: Events are exhaustive if their union equals the entire sample space. Compute: \( P \cup Q \cup R = \{1, 2\} \cup \{3, 4\} \cup \{5, 6\} = \{1, 2, 3, 4, 5, 6\} = S \). Since the union of \( P \), \( Q \), and \( R \) equals \( S \), the three events are exhaustive.
  5. Step 5: Conclusion: The events \( P = \{1, 2\} \), \( Q = \{3, 4\} \), and \( R = \{5, 6\} \) satisfy both conditions: pairwise intersections are all \( \emptyset \) (mutually exclusive) and their union is \( S \) (exhaustive). Therefore, \( P \), \( Q \), and \( R \) are mutually exclusive and exhaustive events.

Answer: Event \( P = \{1, 2\} \) (number less than 3), event \( Q = \{3, 4\} \) (number equal to 3 or 4), and event \( R = \{5, 6\} \) (number greater than 4). These satisfy \( P \cap Q = Q \cap R = P \cap R = \emptyset \) (mutually exclusive) and \( P \cup Q \cup R = S \) (exhaustive).

Everything you get with Solver7

More questions in Probability

Chapter 14 Examples Q1(i) Chapter 14 Examples Q1(ii) Chapter 14 Examples Q1(iii) Chapter 14 Examples Q1(iv) Chapter 14 Examples Q2 Chapter 14 Examples Q3 Chapter 14 Examples Q4 Chapter 14 Examples Q5(i) Chapter 14 Examples Q5(ii) Chapter 14 Examples Q5(iii) Chapter 14 Examples Q5(iv) Chapter 14 Examples Q5(v) Chapter 14 Examples Q6(i) Chapter 14 Examples Q6(ii) Chapter 14 Examples Q6(iii) Chapter 14 Examples Q6(iv) Chapter 14 Examples Q6(v) Chapter 14 Examples Q7(a) Chapter 14 Examples Q7(b) Chapter 14 Examples Q7(c) Chapter 14 Examples Q8(a) Chapter 14 Examples Q8(b) Chapter 14 Examples Q8(c) Chapter 14 Miscellaneous Examples Q9(i) Chapter 14 Miscellaneous Examples Q9(ii) Chapter 14 Miscellaneous Examples Q9(iii) Chapter 14 Miscellaneous Examples Q9(iv) Chapter 14 Miscellaneous Examples Q9(v) Chapter 14 Miscellaneous Examples Q10(i) Chapter 14 Miscellaneous Examples Q10(ii) Chapter 14 Miscellaneous Examples Q10(iii) Chapter 14 Miscellaneous Examples Q11 Chapter 14 Miscellaneous Examples Q12(a) Chapter 14 Miscellaneous Examples Q12(b) Exercise 14.1 Q1 Exercise 14.1 Q2 Exercise 14.1 Q3 Exercise 14.1 Q4(i) Exercise 14.1 Q4(ii) Exercise 14.1 Q4(iii) Exercise 14.1 Q5(i) Exercise 14.1 Q5(iii) Exercise 14.1 Q5(iv) Exercise 14.1 Q5(v) Exercise 14.1 Q6(i) Exercise 14.1 Q6(ii) Exercise 14.1 Q6(iii) Exercise 14.1 Q6(iv) Exercise 14.1 Q6(v) Exercise 14.1 Q6(vi) Exercise 14.1 Q6(vii) Exercise 14.1 Q6(viii) Exercise 14.1 Q7(i) Exercise 14.1 Q7(ii) Exercise 14.1 Q7(iii) Exercise 14.1 Q7(iv) Exercise 14.1 Q7(v) Exercise 14.1 Q7(vi) Exercise 14.2 Q1 Exercise 14.2 Q2