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

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\) and \(B\) before \(C?\)

CBSE Class 11 Maths · Probability

Solution

👶 Simple Explanation

Simple Explanation

Imagine Veena picks the order of her four city visits by pulling names out of a hat. She wants to visit city A, then city B, then city C — in that exact order. Think of it like arranging three friends in a line: there are only 6 possible ways to line them up. Only one of those ways matches the order A, then B, then C. So the chance of that happening is 1 out of 6, which means the probability is \( \dfrac{1}{6} \).

Answer: The probability that Veena visits \(A\) before \(B\) and \(B\) before \(C\) is \( \dfrac{1}{6} \).

📖 Probability of Visiting Cities A, B, C in a Fixed Order

Detailed Explanation

Veena visits four cities in a random order. So the sample space is the set of all possible orderings (arrangements) of the four cities \(A, B, C, D\). The total number of ways to arrange \(4\) distinct cities is \(4! = 24\), and since the order is random, every arrangement is equally likely. We need the probability that \(A\) comes before \(B\), and \(B\) comes before \(C\). This is a condition on the relative order of the three cities \(A, B, C\) only; the city \(D\) can sit anywhere. A neat idea is that among the three cities \(A, B, C\), there are \(3! = 6\) possible relative orders, all equally likely, and only ONE of them is the required order \(A\) then \(B\) then \(C\). Using axiomatic probability, \(P(E) = \dfrac{\text{number of favourable outcomes}}{\text{total number of outcomes}}\).

Formula Used

\( P(E) = \dfrac{\text{Number of favourable outcomes}}{\text{Total number of outcomes in } S} \), with total arrangements \( = n! \)

Solution

  1. Step 1: Find the total number of outcomes. Veena visits \(4\) distinct cities in some order, so the number of possible orderings is \[ 4! = 4 \times 3 \times 2 \times 1 = 24. \] Each of these \(24\) arrangements is equally likely.
  2. Step 2: Identify the favourable event. We want the arrangements in which \(A\) appears before \(B\) and \(B\) appears before \(C\). In other words, the three cities \(A, B, C\) must appear in the relative order \(A \to B \to C\), while \(D\) may be placed anywhere.
  3. Step 3: Count the favourable outcomes directly. First place the three cities \(A, B, C\) so that their order is fixed as \(A, B, C\). Now insert the fourth city \(D\) into this sequence. There are \(4\) possible positions for \(D\): before \(A\), between \(A\) and \(B\), between \(B\) and \(C\), or after \(C\). This gives \[ 4 \text{ favourable arrangements}. \]
  4. Step 4: Apply the probability formula. \[ P(E) = \frac{\text{Favourable outcomes}}{\text{Total outcomes}} = \frac{4}{24} = \frac{1}{6}. \]
  5. Step 5: Cross-check with the relative-order idea. The three cities \(A, B, C\) can appear in \(3! = 6\) equally likely relative orders, and exactly one of them is \(A\) before \(B\) before \(C\). So the probability is \[ \frac{1}{3!} = \frac{1}{6}, \] which matches Step 4.

Final Answer

The probability that Veena visits \(A\) before \(B\) and \(B\) before \(C\) is \( \dfrac{1}{6} \).

Common Mistake

A common mistake is to think only three cities are being arranged and use total \(3! = 6\) as the sample space, ignoring the fourth city \(D\). Since all four cities are visited, the sample space has \(4! = 24\) outcomes. It just happens that the favourable count \(4\) also gives \( \frac{4}{24} = \frac{1}{6} \); do not confuse the shortcut idea with the actual size of the sample space.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the sample space. Veena visits four distinct cities \( A, B, C, D \) in a random order, so the sample space \( S \) consists of all possible arrangements of these four cities. The total number of such arrangements is \[ 4! = 4 \times 3 \times 2 \times 1 = 24. \] — Reason: Since every ordering is equally likely, we must first know how many total orderings exist before computing any probability.
  2. Step 2: State the required event. Let \( E \) be the event that Veena visits \( A \) before \( B \) and \( B \) before \( C \), i.e., the three cities appear in the relative order \( A \to B \to C \) within whatever full arrangement she follows. The position of city \( D \) does not affect this condition at all. — Reason: Clearly defining the event helps us decide exactly which arrangements to count as favourable.
  3. Step 3: Focus on the relative order of \( A, B, C \) alone. Among only three cities \( A, B, C \), the total number of possible relative orderings (i.e., who appears first, second, third among these three) is \[ 3! = 6. \] These six relative orders are: \( A, B, C \); \( A, C, B \); \( B, A, C \); \( B, C, A \); \( C, A, B \); \( C, B, A \). — Reason: Because \( D \) can appear anywhere without restricting the \( A, B, C \) ordering, we only need to examine how \( A, B, C \) are ordered relative to each other.
  4. Step 4: Count the favourable relative orders for \( A, B, C \). Out of the 6 equally likely relative orders listed above, exactly ONE satisfies \( A \) before \( B \) and \( B \) before \( C \), which is the order \( A, B, C \). — Reason: Only one arrangement places all three cities in the required sequence, so the number of favourable relative orders is 1.
  5. Step 5: Count the total favourable full arrangements. For each of the 6 relative orders of \( A, B, C \), city \( D \) can be placed in any of the 4 positions in the full sequence, giving \[ 4 \text{ choices for } D \text{ per relative order of } A, B, C. \] So the total number of full arrangements is \( 6 \times 4 = 24 \), which correctly matches \( 4! \). Out of these, only those with the relative order \( A \to B \to C \) are favourable, giving \( 1 \times 4 = 4 \) favourable arrangements. — Reason: This confirms that exactly \( \frac{1}{6} \) of all arrangements satisfy the condition, regardless of where \( D \) falls.
  6. Step 6: Apply the probability formula. Using \[ P(E) = \frac{\text{Number of favourable outcomes}}{\text{Total number of outcomes}}, \] we substitute the values: \[ P(E) = \frac{4}{24} = \frac{1}{6}. \] — Reason: Dividing favourable outcomes by total outcomes gives the required probability, since all arrangements are equally likely.

Final Answer

The probability that Veena visits \(A\) before \(B\) and \(B\) before \(C\) is \( \dfrac{1}{6} \).

Common Mistake

One common mistake: Students often only count arrangements of \( A, B, C \) (getting \( 3! = 6 \) total) and write \( P(E) = \frac{1}{3!} \) without accounting for city \( D \). While the final fraction \( \frac{1}{6} \) is the same, the reasoning must use all \( 4! = 24 \) total arrangements and \( 4 \) favourable ones (i.e., \( \frac{4}{24} \)) for a complete and correct solution.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Total arrangements of 4 cities: \[4! = 24\]
  2. Step 2: Favourable outcomes: \(A, B, C\) must appear in relative order \(A \to B \to C\); city \(D\) can be in any of 4 positions, giving \(4! \div 3! = 4\) arrangements. Alternatively, only \(1\) out of \(3! = 6\) relative orderings of \(A, B, C\) is favourable, so favourable count \(= 24 \div 6 = 4\).
  3. Step 3: \[P(E) = \frac{4}{24} = \frac{1}{6}\]

Answer: The probability that Veena visits \(A\) before \(B\) and \(B\) before \(C\) is \( \dfrac{1}{6} \).

➕ More Examples

More Examples

Example 1

Question: Five students P, Q, R, S, and T are randomly seated in a row. What is the probability that P sits before Q and Q sits before R?

Solution: Step 1: Find the total number of arrangements. The total number of ways to seat 5 students in a row is \[5! = 120\] Step 2: Count the favourable arrangements. We need P before Q and Q before R, meaning the relative order of P, Q, R (among themselves) must be exactly P, Q, R. The three students P, Q, R can be arranged among themselves in \(3! = 6\) equally likely relative orders. Only 1 of these 6 orders satisfies P before Q before R. For every fixed set of 3 positions occupied by P, Q, R, the remaining 2 students (S and T) can be placed in the remaining 2 seats in \(2!\) ways, but this does not affect the fraction — by symmetry, exactly \(\frac{1}{6}\) of all 120 arrangements have the required order. Number of favourable arrangements = \(\frac{5!}{3!} \times 1 = 20\) Explanation: Choose and arrange the other 2 students freely in the remaining positions, then for each such placement, exactly 1 out of 6 relative arrangements of P, Q, R works, giving \(\frac{120}{6} = 20\). Step 3: Calculate the probability. \[P(\text{P before Q before R}) = \frac{20}{120} = \frac{1}{6}\]

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

Example 2

Question: Six athletes — L, M, N, K, J, and H — finish a race in a random order (no ties). What is the probability that L finishes before M, and M finishes before N, and N finishes before K?

Solution: Step 1: Find the total number of possible finishing orders. The total number of ways 6 athletes can finish is \[6! = 720\] Step 2: Identify the condition. We need a specific relative order among 4 athletes: L before M, M before N, and N before K. This means among L, M, N, K the relative order must be exactly L, M, N, K. Step 3: Count the favourable outcomes. The 4 athletes L, M, N, K can appear in \(4! = 24\) equally likely relative orders among themselves. Only 1 of these 24 satisfies L before M before N before K. So, by symmetry, exactly \(\frac{1}{24}\) of all arrangements satisfy the condition. Number of favourable arrangements = \(\frac{720}{24} = 30\) Step 4: Calculate the probability. \[P(\text{L before M before N before K}) = \frac{30}{720} = \frac{1}{24}\]

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

🎯 Try a Similar Question

Try a Similar Question

Question: A tourist plans to visit five cities P, Q, R, S, and T in a random order. What is the probability that he visits P before Q, Q before R, and R before S?

Solution

  1. Step 1: Find the total number of ways to visit 5 cities: The tourist visits 5 cities in a random order. The total number of possible orderings (permutations) of 5 cities is \( 5! \). Calculating: \[ 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120 \]
  2. Step 2: Identify the condition: We need the probability that P is visited before Q, Q is visited before R, and R is visited before S. In other words, we need the four cities P, Q, R, S to appear in the relative order P, Q, R, S (with T appearing anywhere among them).
  3. Step 3: Count the favourable outcomes: Consider only the 4 cities P, Q, R, S. Among themselves, these 4 cities can be arranged in \( 4! = 24 \) ways, but only 1 of these arrangements has them in the order P, Q, R, S. The city T can occupy any position freely, so the fraction of all 120 arrangements in which P, Q, R, S appear in the required relative order is \[ \frac{1}{4!} = \frac{1}{24} \] Therefore the number of favourable outcomes is \[ \frac{120}{24} = 5 \]
  4. Step 4: Calculate the probability: Using the classical definition of probability: \[ P(\text{P before Q, Q before R, R before S}) = \frac{\text{Favourable outcomes}}{\text{Total outcomes}} = \frac{5}{120} = \frac{1}{24} \]
  5. Step 5: Verification using symmetry: By symmetry, among all \( 4! = 24 \) relative orderings of P, Q, R, S, exactly 1 ordering satisfies P before Q before R before S. So the probability is simply \[ \frac{1}{4!} = \frac{1}{24} \] This confirms our answer.

Answer: The probability that the tourist visits P before Q, Q before R, and R before S is \( \dfrac{1}{24} \).

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