The Art of the Fixed Event
Mastering Probability Constraints
Imagine you are sitting in the stands, the tension of a five-match cricket series hanging in the air. You are not just watching the game; you are analyzing the very fabric of chance.
The problem before us is a classic JEE-style puzzle that tests your ability to look past the noise and focus on the rigid constraints of a scenario. We are told the probability of India winning a match is P(W)=21, and consequently, the probability of losing is P(L)=1−21=21.
The series consists of five matches, but here is the twist: we need the second win to occur exactly at the third test. Let us break this down.
Phase 1
The Anchor of the Third Match
The most critical step in solving any probability problem with a specific condition is to identify the 'anchor' or the 'fixed event'. The condition states that the second win occurs at the third test. This is not a suggestion; it is a mathematical guarantee.
It means that for our scenario to be valid, the third match must be a win. We can lock this in immediately.
If the third match were a loss, the condition would be violated. If the third match were the first win, the condition would be violated. By fixing the third match as a win, we have simplified our universe of possibilities significantly.
Phase 2
The 'Before' Story
Now, let us look at the first two matches. If the third match is the second win, what must have happened in the first two?
We need exactly one win and one loss in the first two matches. Why? Because if India had won both, the third match would be the third win, not the second.
If they had lost both, the third match would be the first win. Therefore, the logic dictates that we must have exactly one win and one loss in the first two matches. This is the heart of the problem—transforming a complex series into a smaller, manageable puzzle.
Phase 3
Identifying the Paths
How can we achieve exactly one win in two matches? There are only two ways this can happen:
1. Case 1: India wins the first match and loses the second. The sequence is (W,L).
2. Case 2: India loses the first match and wins the second. The sequence is (L,W).
Now, we append our 'anchor'—the third match, which we know must be a win. So our two valid sequences for the first three matches are (W,L,W) and (L,W,W).
Phase 4
The Calculation
Because the matches are independent, the probability of a sequence is simply the product of the individual probabilities. For Case 1, the sequence is (W,L,W).
The probability is:
P(W,L,W)=P(W)×P(L)×P(W)=21×21×21=81
For Case 2, the sequence is (L,W,W). The probability is:
P(L,W,W)=P(L)×P(W)×P(W)=21×21×21=81
Phase 5
The Final Synthesis
We have two mutually exclusive paths that satisfy our condition. To find the total probability, we add them together:
TotalProbability=P(W,L,W)+P(L,W,W)=81+81=82=41
And there you have it! The beauty of this solution lies in its simplicity.
We ignored the 4th and 5th matches because, once the condition is met at the 3rd match, the rest of the series is irrelevant to the specific question asked. This is the JEE mindset: identify the constraint, isolate the relevant events, and calculate with precision.
You have just mastered the art of the fixed event, and the final answer is 41.