The Geometry of Chance
A Journey Through Dice
Welcome, future engineers! Today, we are not just solving a probability problem; we are embarking on a journey to visualize the hidden geometry of chance.
When we throw two dice, we are essentially navigating a 6×6 grid of possibilities. Let's break this down, step by step, and see how logic can turn a seemingly complex problem into a simple, elegant solution.
Mapping the Universe
Imagine a grid where the x-axis represents the result of the first die and the y-axis represents the second. Each point (x,y) is a unique outcome.
With six faces on each die, our entire universe, the sample space S, consists of 6×6=36 points. This is our foundation.
Whenever you face a probability problem involving dice, always start by visualizing this grid. It grounds your intuition.
Defining the Events
We have three events defined by specific constraints:
1. Event A: The first die is strictly less than the second (x<y). Geometrically, these are all the points lying strictly above the diagonal line y=x.
To count these, we can use combinations. We need to choose two distinct numbers from the set {1,2,3,4,5,6}. The number of ways to do this is:
2. Event B: The first die is even, and the second is odd. We have 3 choices for the first die {2,4,6} and 3 choices for the second {1,3,5}.
Thus, n(B)=3×3=9.
3. Event C: The first die is odd, and the second is even. Similarly, we have 3 choices for the first die {1,3,5} and 3 choices for the second {2,4,6}.
Thus, n(C)=3×3=9.
The Power of Distributive Logic
Now, we face the core of the problem: finding the favorable cases for (A∪B)∩C. At first glance, this looks intimidating. But here is where the beauty of set theory shines.
We apply the Distributive Law:
This transformation is the key. It splits our complex problem into two distinct, manageable parts.
Now, let's analyze the second part: B∩C. Event B demands the first die be even, while Event C demands it be odd. Since a number cannot be both even and odd, B∩C=∅. The intersection is empty!
The Final Count
Because B∩C is the null set, our expression simplifies beautifully to just A∩C. We are now looking for points that satisfy both Event A (x<y) and Event C (x is odd, y is even).
Let's count them systematically by iterating through the possible values of x (which must be odd):
- If x=1: y must be even and y>1. The possible values for y are {2,4,6}. That gives us 3 pairs: (1,2),(1,4),(1,6).
- If x=3: y must be even and y>3. The possible values for y are {4,6}. That gives us 2 pairs: (3,4),(3,6).
- If x=5: y must be even and y>5. The only possible value for y is {6}. That gives us 1 pair: (5,6).
Adding these up, we get 3+2+1=6 favorable cases.
The logic holds, the math is clean, and we have arrived at the answer. Remember, in JEE, the most complex-looking problems often collapse into simple truths if you apply the right logical framework. Keep practicing, keep visualizing, and most importantly, keep falling in love with the process!