Analyzing the Setup
Imagine you are standing before a bag containing 4 white balls and 6 black balls. You are about to embark on a two-step experiment: drawing two balls, one by one, without putting the first one back.
This simple act of 'without replacement' is the heartbeat of this problem. It introduces a memory into the system; the bag remembers what you took, and that memory dictates the future.
The Anatomy of Conditional Probability
We are tasked with finding the probability that the first ball was black, given that the second ball is black. Let B1 be the event that the first ball is black, and B2 be the event that the second ball is black.
We seek P(B1∣B2). By the fundamental definition of conditional probability, we know that:
P(B1∣B2)=P(B2)P(B1∩B2)
This formula is our map. The numerator, P(B1∩B2), is the probability of the path where both balls are black. The denominator, P(B2), is the total probability of the second ball being black, regardless of what happened first.
The Two Paths to the Second Black Ball
To find P(B2), we must account for every possible way to reach that outcome. There are two distinct paths: Path A, where we draw a black ball first, and Path B, where we draw a white ball first.
For Path A, the probability of drawing a black ball first is P(B1)=106. Once that black ball is gone, the bag holds 9 balls, 5 of which are black. Thus, the probability of the second being black is P(B2∣B1)=95.
Multiplying these, we get:
P(B1∩B2)=106×95=9030
Now, consider Path B. The probability of drawing a white ball first is P(W1)=104. If we remove a white ball, the bag still contains all 6 black balls, but only 9 balls in total.
So, P(B2∣W1)=96. Multiplying these gives:
P(W1∩B2)=104×96=9024
The Grand Synthesis
The total probability of the second ball being black is the sum of these two mutually exclusive paths:
P(B2)=P(B1∩B2)+P(W1∩B2)=9030+9024=9054
Now, we return to our conditional probability formula:
The 90 in the denominator cancels out beautifully, leaving us with 5430. Simplifying this fraction by dividing both numerator and denominator by 6, we arrive at 95.
The problem states this is nm with gcd(m,n)=1. Thus, m=5 and n=9. The final step is:
m+n=5+9=14