Analyzing the Setup
When you throw two fair dice, the first die can land on any of 6 faces, and the second can also land on any of 6 faces. By the Fundamental Counting Principle, the total number of outcomes is 6×6=36.
Imagine a 6×6 grid on your desk. Every point (i,j) on this grid represents a unique outcome, forming the foundation of our entire calculation.
The Hunt for Nine
Identifying Success
We are hunting for a sum of exactly 9. Let's systematically list the pairs that satisfy this condition: (3,6), (4,5), (5,4), and (6,3).
There are exactly 4 favorable outcomes. If we define 'success' as rolling a 9, the probability of success in a single throw is:
Consequently, the probability of failure—rolling anything other than a 9—is:
This is our binary reality: in every throw, you either succeed with probability 91 or you fail with probability 98.
The Binomial Bridge
Why We Use It
We are throwing the dice three times, which constitutes three independent trials. We want success exactly twice.
Because the order of successes and failures matters, we invoke the Binomial Distribution, X∼B(n,p), where n=3 and r=2. The Binomial Formula is our bridge:
The term (rn) (or 'n choose r') is the genius of the formula; it calculates exactly how many ways we can arrange those two successes among the three trials.
The Final Calculation
Bringing It Home
Now, we substitute our values into the formula: n=3, r=2, p=91, and q=98. The expression becomes:
P(X=2)=(23)(91)2(98)3−2
First, calculate the combination: (23)=3. Next, calculate the powers:
Putting it all together, we have:
Finally, we simplify by dividing both the numerator and the denominator by 3. We arrive at our elegant final answer: