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
CBSE Class 11 Maths · Probability
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} \).
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}}\).
\( P(E) = \dfrac{\text{Number of favourable outcomes}}{\text{Total number of outcomes in } S} \), with total arrangements \( = n! \)
The probability that Veena visits \(A\) before \(B\) and \(B\) before \(C\) is \( \dfrac{1}{6} \).
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.
The probability that Veena visits \(A\) before \(B\) and \(B\) before \(C\) is \( \dfrac{1}{6} \).
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.
Answer: The probability that Veena visits \(A\) before \(B\) and \(B\) before \(C\) is \( \dfrac{1}{6} \).
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}\)
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}\)
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?
Answer: The probability that the tourist visits P before Q, Q before R, and R before S is \( \dfrac{1}{24} \).