The Dance of the Dice
A Probability Masterclass
Imagine you are standing in a quiet room, holding an unbiased six-sided die. You are about to roll it three times.
Each roll is a moment of pure chance, yet when we look at the sequence of outcomes x1,x2,x3, we are looking at a mathematical structure. Today, we are going to unravel the beauty behind the probability of a strictly increasing sequence: x1<x2<x3.
Defining the Universe
Before we dive into the constraints, we must understand the total possibilities. When you roll a die once, you have 6 outcomes.
When you roll it three times, the total number of outcomes is the product of the possibilities for each roll. Mathematically, this is:
This is our sample space—the entire universe of outcomes. Every single one of these 216 possibilities is equally likely, provided the die is fair.
The Heart of the Constraint
The question asks for the probability that the number obtained in the ith roll is strictly greater than the number obtained in the (i−1)th roll. This translates to the condition x1<x2<x3.
This is not just a condition; it is a filter. It discards any sequence where a number repeats or decreases.
For example, (1,2,2) is out because 2 is not strictly greater than 2. Similarly, (3,2,1) is out because it is decreasing. We are looking for the rare, elegant sequences that climb steadily upward.
The Selection vs
Arrangement Revelation
Here is where most students stumble. They try to count the sequences one by one, which is a recipe for disaster.
Instead, let's use the power of combinatorics. Notice that for any set of three distinct numbers chosen from {1,2,3,4,5,6}, there is exactly one way to arrange them in increasing order.
If you pick the set {1,4,6}, the only valid sequence is (1,4,6). If you pick {2,3,5}, the only valid sequence is (2,3,5).
This is the "Aha!" moment. We don't need to worry about the order of the rolls because the inequality x1<x2<x3 forces the order for us.
Therefore, the number of favorable outcomes is simply the number of ways to select three distinct numbers from the six available. This is a classic combination problem: (36).
The Final Calculation
Let's compute the favorable outcomes. The formula for combinations is (rn)=r!(n−r)!n!.
Plugging in our values, we get:
(36)=3!3!6!=3×2×16×5×4=20
There are exactly 20 such sequences that satisfy our condition.
Now, we bring it all together. The probability P is the ratio of favorable outcomes to total outcomes:
To simplify this, we divide both the numerator and the denominator by 4. Thus, the final probability is:
Conclusion
The Elegance of Logic
We didn't brute-force the problem. We looked at the structure of the inequality, realized that selection was equivalent to arrangement due to the strict ordering, and reduced a complex counting problem to a simple combination.
This is the essence of JEE Advanced mathematics: finding the underlying symmetry that makes the impossible, possible. Keep practicing this mindset, and you will find that even the most daunting problems have a beautiful, logical core.