Suppose that we have a row of taps, all of which run into the same tank. Each tap fills the tank at a different rate, such that the th tap can fill the tank in hours.
Two taps, chosen at random, are turned on and allowed to fill the tank. The expected time, in hours, that it will take to fill the tank is , where and are positive coprime integers. Find .
Note: You may need a calculator for the last step of the problem.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
If the two taps chosen can fill the tank in m and n hours, respectively, then together they can fill the tank at a rate of
m 1 + n 1 = m n m + n "tanks" per hour.
The time taken to fill the tank is then the reciprocal of this expression, namely m + n m n hours.
Now there are ( 2 5 ) = 1 0 possible combinations of 2 taps chosen from the 5 available. Since each of these combinations is equally likely, to find the expected time to fill the tank we just need to sum the 1 0 possible times and then divide the result by 1 0 . This gives us an expected time of
1 0 1 ∗ ( 3 2 + 4 3 + 5 4 + 6 5 + 5 6 + 6 8 + 7 1 0 + 7 1 2 + 8 1 5 + 9 2 0 ) = 5 0 4 0 6 4 6 3 .
Thus a = 6 4 6 3 , b = 5 0 4 0 and a − b = 1 4 2 3 .