SOLVER7 Study. Nothing Else.
Chapter 14 Miscellaneous Examples Q9(i)

On her vacations Veena visits four cities \((A, B, C\) and \(D)\) in a random order. What is the probability that she visits \(A\) before \(B?\)

CBSE Class 11 Maths · Probability

Solution

👶 Simple Explanation

Simple Explanation

Imagine you write the names of four cities on slips of paper and pull them out of a bag one by one. City A and City B each have an equal chance of coming out earlier than the other. There is no reason to favour one over the other, so exactly half the time A comes before B, and the other half B comes before A. It is just like flipping a fair coin — heads or tails, both equally likely. So the chance that A is visited before B is one out of two.

Answer: \( P(A \text{ before } B) = \dfrac{1}{2} \).

📖 Probability that Veena Visits A before B

Detailed Explanation

Veena visits four cities \( A, B, C, D \) in a random order. A 'random order' means every possible arrangement (permutation) of the four cities is equally likely to occur. The total number of ways to arrange \( 4 \) distinct cities is \( 4! \). Each of these arrangements forms one outcome in the sample space, and each has the same probability. We want the probability that \( A \) appears somewhere before \( B \) in her tour. A neat way to think about this is symmetry: in any arrangement, either \( A \) comes before \( B \), or \( B \) comes before \( A \). There is no 'tie' since all cities are visited once. By symmetry, these two situations are equally likely, so the probability of each must be one half.

Formula Used

\( P(E) = \dfrac{\text{Number of favourable outcomes}}{\text{Total number of outcomes}} \), with total outcomes \( = 4! \).

Solution

  1. Step 1: Find the size of the sample space. Since the four cities \( A, B, C, D \) are visited in a random order, the total number of possible orders is the number of permutations of \( 4 \) distinct objects: \[ 4! = 4 \times 3 \times 2 \times 1 = 24. \] So there are \( 24 \) equally likely outcomes.
  2. Step 2: Understand the event. Let \( E \) be the event that \( A \) is visited before \( B \). We must count how many of the \( 24 \) orderings have \( A \) appearing somewhere before \( B \) (the cities \( C \) and \( D \) can be anywhere).
  3. Step 3: Use the symmetry argument. In every arrangement of the four cities, \( A \) and \( B \) appear in some relative order: either \( A \) comes before \( B \), or \( B \) comes before \( A \). These two cases cover all outcomes and cannot happen together. For each arrangement where \( A \) is before \( B \), swapping the positions of \( A \) and \( B \) gives exactly one arrangement where \( B \) is before \( A \). This pairing shows the two cases contain equally many outcomes.
  4. Step 4: Count the favourable outcomes. Since the \( 24 \) arrangements split equally between 'A before B' and 'B before A', the number of favourable outcomes is \[ \frac{24}{2} = 12. \]
  5. Step 5: Apply the probability formula. \[ P(E) = \frac{\text{Favourable outcomes}}{\text{Total outcomes}} = \frac{12}{24} = \frac{1}{2}. \]

Final Answer

\( P(A \text{ before } B) = \dfrac{1}{2} \).

Common Mistake

A common mistake is thinking the positions of the other two cities \( C \) and \( D \) change the answer, or forgetting that every one of the \( 24 \) orderings is equally likely. The relative order of \( A \) and \( B \) alone decides the event, and by symmetry it is exactly \( \tfrac{1}{2} \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Set up the sample space: Veena visits four cities \( A, B, C, D \) in a completely random order, meaning every possible arrangement is equally likely. The total number of distinct arrangements of 4 cities is \[ 4! = 4 \times 3 \times 2 \times 1 = 24. \] Reason: We need to know the size of the sample space before we can compute any probability.
  2. Step 2: Define the event clearly: Let event \( E \) be the event that city \( A \) is visited at some point before city \( B \) in Veena's tour (cities \( C \) and \( D \) can appear anywhere). We need to count how many of the 24 arrangements satisfy this condition. Reason: A precise definition of the event prevents us from accidentally including or excluding outcomes.
  3. Step 3: Observe the symmetry between A and B: In any arrangement of the four cities, exactly one of the following must be true: either \( A \) appears before \( B \), or \( B \) appears before \( A \). There is no possibility of a tie because each city is visited exactly once. Since the arrangement is completely random, both situations are equally likely by symmetry. Reason: Symmetry means neither \( A \) nor \( B \) has any special advantage over the other in a random ordering.
  4. Step 4: Count the favourable outcomes: Since the 24 arrangements split evenly into those where \( A \) comes before \( B \) and those where \( B \) comes before \( A \), the number of favourable outcomes is \[ \frac{24}{2} = 12. \] Reason: The symmetry argument guarantees an exact half-half split, so we simply divide the total by 2.
  5. Step 5: Apply the probability formula: Substituting into the classical probability formula: \[ P(E) = \frac{\text{Number of favourable outcomes}}{\text{Total number of outcomes}} = \frac{12}{24} = \frac{1}{2}. \] Reason: With the favourable and total counts both known, we compute the probability directly.

Final Answer

\( P(A \text{ before } B) = \dfrac{1}{2} \).

Common Mistake

One common mistake: Students sometimes try to list and count all 24 arrangements individually, which is time-consuming and error-prone; recognising the symmetry between \( A \) and \( B \) gives the answer immediately without exhaustive listing.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Total arrangements of cities \( A, B, C, D \): \[ 4! = 24 \]
  2. Step 2: Favourable outcomes (A before B): by symmetry, exactly half of all arrangements have A before B, giving \( 24 \div 2 = 12 \) favourable outcomes.
  3. Step 3: \[ P(A \text{ before } B) = \frac{12}{24} = \frac{1}{2} \]

Answer: \( P(A \text{ before } B) = \dfrac{1}{2} \).

➕ More Examples

More Examples

Example 1

Question: Five friends — Arjun, Bhavna, Chetan, Deepa, and Esha — line up in a random order for a group photograph. What is the probability that Arjun stands somewhere before Chetan in the line?

Solution: Step 1: Find the total number of arrangements of 5 friends. Total arrangements = \[5! = 120\] Step 2: Count the favourable arrangements (Arjun appears before Chetan). For any arrangement of all 5 friends, either Arjun comes before Chetan or Chetan comes before Arjun. By symmetry, both cases are equally likely and together they cover all arrangements. Number of favourable arrangements = \[\frac{5!}{2} = \frac{120}{2} = 60\] Step 3: Calculate the probability. \[P(\text{Arjun before Chetan}) = \frac{60}{120} = \frac{1}{2}\]

Answer: \(\dfrac{1}{2}\)

Example 2

Question: Six books — labelled P, Q, R, S, T, and U — are placed on a shelf in a random order. What is the probability that book P appears to the left of book Q on the shelf?

Solution: Step 1: Find the total number of ways to arrange 6 books. Total arrangements = \[6! = 720\] Step 2: Count the favourable arrangements (book P is to the left of book Q). Choose 2 positions out of 6 for P and Q: there are \(\binom{6}{2} = 15\) ways to choose these positions. For each choice, exactly one arrangement places P to the left of Q. The remaining 4 books fill the other 4 positions in \(4!\) ways. Number of favourable arrangements = \[\binom{6}{2} \times 4! = 15 \times 24 = 360\] Alternatively, by symmetry exactly half of all arrangements have P before Q, giving \(720 / 2 = 360\) favourable arrangements. Step 3: Calculate the probability. \[P(\text{P before Q}) = \frac{360}{720} = \frac{1}{2}\]

Answer: \(\dfrac{1}{2}\)

🎯 Try a Similar Question

Try a Similar Question

Question: Five friends — Aman, Bela, Chirag, Diya, and Esha — are assigned seats in a row at random. What is the probability that Aman gets a seat before both Bela and Chirag (i.e., Aman's seat number is smaller than Bela's seat number AND smaller than Chirag's seat number)?

Solution

  1. Step 1: Find the Total Number of Arrangements: Five friends can be seated in a row in \( 5! \) ways. We have \[5! = 120\] total equally likely arrangements.
  2. Step 2: Identify the Key Condition: We need the probability that Aman (A) occupies a position with a smaller seat number than both Bela (B) and Chirag (C). The positions of the other two friends (Diya and Esha) do not affect this condition. So we focus on the relative order of just the three people: Aman, Bela, and Chirag.
  3. Step 3: Count Arrangements of A, B, C by Symmetry: Among the three people A, B, and C, there are \( 3! = 6 \) equally likely relative orderings. We list them: ABС, ACB, BAC, BCA, CAB, CBA. Out of these 6 orderings, only those where A appears first (i.e., before both B and C) are favourable. The favourable orderings are ABC and ACB — that is 2 out of 6.
  4. Step 4: Compute the Probability: Since all arrangements of the five friends are equally likely, the probability depends only on the relative order of A, B, and C. The probability that A comes before both B and C is \[P = \frac{2}{6} = \frac{1}{3}.\]
  5. Step 5: Verify Using Direct Counting: We can also verify directly. Fix the positions of Diya and Esha — they can occupy any 2 of the 5 positions in \( {}^{5}P_{2} = 20 \) ways. The remaining 3 positions go to A, B, C. Among the \( 3! = 6 \) orderings of A, B, C in those 3 positions, exactly 2 have A first. So favourable arrangements \( = 20 \times 2 = 40 \). Thus \[P = \frac{40}{120} = \frac{1}{3}.\] This confirms our answer.

Answer: The probability that Aman gets a seat before both Bela and Chirag is \( \dfrac{1}{3} \).

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(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(ii) 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