SOLVER7 Study. Nothing Else.
Chapter 14 Miscellaneous Examples Q12(b)

In a relay race there are five teams \(A,B,C,D\) and \(E.\) What is the probability that \(A,B\) and \(C\) are first three to finish (in any order)(Assume that all finishing orders are equally likely)

CBSE Class 11 Maths · Probability

Solution

👶 Simple Explanation

Simple Explanation

Imagine five friends — A, B, C, D, and E — running a race. We want to find how likely it is that A, B, and C finish in the top three spots, while D and E finish last. All finishing orders are equally possible, like shuffling five cards randomly. Out of every possible way the race can end, only a small number have A, B, C at the top and D, E at the bottom. When we count those and compare to all possibilities, the chance turns out to be \( \dfrac{1}{10} \).

Answer: The required probability is \( \dfrac{1}{10} \).

📖 Probability that A, B and C Finish First

Detailed Explanation

There are five teams finishing a race, so a possible outcome is an arrangement (ordering) of all five teams. Since all finishing orders are equally likely, we use the classical definition of probability, where the probability of an event equals the number of favourable outcomes divided by the total number of outcomes. The total number of outcomes is the number of ways to arrange all five teams, which is \( 5! \). A favourable outcome is one where teams A, B and C take the first three positions (in any order among themselves) and D, E take the last two positions (in any order among themselves). We count these favourable arrangements and then apply the probability formula.

Formula Used

Number of ways to arrange \( n \) distinct objects is \( n! \). Classical probability: \[ P(E) = \frac{\text{Number of favourable outcomes}}{\text{Total number of outcomes}} \]

Solution

  1. Step 1: Find the total number of possible finishing orders. Since there are 5 teams and each finishing order is a distinct arrangement of all 5 teams, the total number of outcomes is \[ 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120. \]
  2. Step 2: Understand the favourable event. We want A, B and C to occupy positions 1, 2 and 3 (in any order among themselves), while D and E occupy positions 4 and 5 (in any order among themselves).
  3. Step 3: Count the arrangements of A, B, C in the first three positions. These 3 teams can be arranged among the first three places in \[ 3! = 3 \times 2 \times 1 = 6 \] ways.
  4. Step 4: Count the arrangements of D, E in the last two positions. These 2 teams can be arranged among the last two places in \[ 2! = 2 \times 1 = 2 \] ways.
  5. Step 5: Find the total number of favourable outcomes by multiplying (using the fundamental principle of counting), since each choice of ordering the first three can be paired with each ordering of the last two: \[ 3! \times 2! = 6 \times 2 = 12. \]
  6. Step 6: Apply the probability formula. \[ P(E) = \frac{\text{favourable outcomes}}{\text{total outcomes}} = \frac{12}{120} = \frac{1}{10}. \]

Final Answer

The required probability is \( \dfrac{1}{10} \).

Common Mistake

A common mistake is counting only the arrangements of A, B, C (that is, \( 3! = 6 \)) and forgetting to also arrange D and E in the last two positions with \( 2! \). This gives a wrong favourable count of 6 instead of 12, leading to an incorrect probability.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Count the total number of ways five teams can finish the race. Since every finishing order is a distinct arrangement of all 5 teams, the total number of outcomes is \[5! = 5 \times 4 \times 3 \times 2 \times 1 = 120\] — Reason: The sample space consists of all possible orderings of 5 distinct teams, which is given by \( 5! \).
  2. Step 2: Identify the favourable event. We need teams A, B, and C to occupy the top three positions (in any order among themselves), while teams D and E fill the last two positions (in any order among themselves) — Reason: Clearly understanding the event helps us count only those arrangements that satisfy the required condition.
  3. Step 3: Count the ways A, B, and C can be arranged among the first three positions. This equals \[3! = 3 \times 2 \times 1 = 6\] — Reason: Any of the 3 teams can take 1st place, any of the remaining 2 can take 2nd, and the last one takes 3rd, giving \( 3! \) arrangements.
  4. Step 4: Count the ways D and E can be arranged among the last two positions. This equals \[2! = 2 \times 1 = 2\] — Reason: Either D or E can finish 4th, and the other finishes 5th, giving \( 2! \) arrangements.
  5. Step 5: Multiply the two counts to get the total number of favourable outcomes. \[\text{Favourable outcomes} = 3! \times 2! = 6 \times 2 = 12\] — Reason: The arrangement of A, B, C among the top three positions is independent of the arrangement of D and E among the last two, so we multiply by the Fundamental Principle of Counting.
  6. Step 6: Apply the classical probability formula. \[P(E) = \frac{12}{120} = \frac{1}{10}\] — Reason: Dividing the number of favourable outcomes by the total number of outcomes gives the required probability.

Final Answer

The required probability is \( \dfrac{1}{10} \).

Common Mistake

One common mistake: Students often count only the arrangements of A, B, C (i.e., \( 3! = 6 \)) and forget to multiply by the \( 2! = 2 \) arrangements of D and E, leading to an incorrect numerator of 6 instead of 12.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Total outcomes: \[5! = 120\]
  2. Step 2: Favourable outcomes (A, B, C in first 3 positions and D, E in last 2 positions): \[3! \times 2! = 6 \times 2 = 12\]
  3. Step 3: \[P(E) = \frac{12}{120} = \frac{1}{10}\]

Answer: The required probability is \( \dfrac{1}{10} \).

➕ More Examples

More Examples

Example 1

Question: In a cycling race, six cyclists P, Q, R, S, T and U compete. What is the probability that P, Q and R finish in the first three positions (in any order)? (Assume all finishing orders are equally likely.)

Solution: Step 1: Find the total number of ways 6 cyclists can finish the race. Total outcomes = \(6!\) \[6! = 720\] Step 2: Count the favourable outcomes — those in which P, Q, and R occupy the first three positions (in any order among themselves), and S, T, U occupy the remaining three positions (in any order among themselves). The number of ways P, Q, R can arrange themselves in the first three positions is \(3!\) \[3! = 6\] The number of ways S, T, U can arrange themselves in the last three positions is also \(3!\) \[3! = 6\] Favourable outcomes = \(3! \times 3! = 6 \times 6 = 36\) Step 3: Calculate the probability. \[P(E) = \frac{3! \times 3!}{6!} = \frac{36}{720} = \frac{1}{20}\]

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

Example 2

Question: Seven students A, B, C, D, E, F and G participate in a quiz competition. What is the probability that A, B, C and D are the top four rankers (in any order among the four)? (Assume all finishing orders are equally likely.)

Solution: Step 1: Find the total number of ways 7 students can be ranked. Total outcomes = \(7!\) \[7! = 5040\] Step 2: Count the favourable outcomes — those in which A, B, C, D occupy the top four positions (in any order among themselves) and E, F, G occupy the remaining three positions (in any order among themselves). The number of ways A, B, C, D can arrange themselves in the top four positions is \(4!\) \[4! = 24\] The number of ways E, F, G can arrange themselves in the remaining three positions is \(3!\) \[3! = 6\] Favourable outcomes = \(4! \times 3! = 24 \times 6 = 144\) Step 3: Calculate the probability. \[P(E) = \frac{4! \times 3!}{7!} = \frac{144}{5040} = \frac{1}{35}\]

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

🎯 Try a Similar Question

Try a Similar Question

Question: In a running competition, there are seven athletes: P, Q, R, S, T, U, and V. What is the probability that P, Q, R, and S finish in the first four positions (in any order)? (Assume all finishing orders are equally likely.)

Solution

  1. Step 1: Find the Total Number of Outcomes: There are 7 athletes, and all possible finishing orders are to be considered. The total number of ways in which all 7 athletes can finish is: \[ 7! = 5040 \]
  2. Step 2: Find the Number of Favorable Outcomes: We want P, Q, R, and S to occupy the first four positions (in any order among themselves), and the remaining 3 athletes (T, U, V) to occupy the last three positions (in any order among themselves). The number of ways P, Q, R, S can arrange themselves in the first four positions is \( 4! \). The number of ways T, U, V can arrange themselves in the last three positions is \( 3! \). So the total number of favorable outcomes is: \[ 4! \times 3! = 24 \times 6 = 144 \]
  3. Step 3: Calculate the Probability: Using the classical definition of probability: \[ P(E) = \frac{\text{Favorable outcomes}}{\text{Total outcomes}} = \frac{144}{5040} \] Simplifying the fraction: \[ P(E) = \frac{144}{5040} = \frac{1}{35} \]
  4. Step 4: Alternative Approach Using Combinations: We can also think of it as: choosing which 4 of the 7 positions are occupied by P, Q, R, S. The number of ways to choose 4 positions out of 7 for a specific group of 4 athletes (regardless of internal order, since both numerator and denominator account for internal arrangements equally) is \( {}^{7}C_{4} = 35 \). Since only 1 such combination has exactly P, Q, R, S in the top 4, the probability is \[ P(E) = \frac{1}{35} \] This confirms our answer.

Answer: The required probability is \( \dfrac{1}{35} \).

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