About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
February 2018 - Solution
This month we chose to present Robert Lang's solution (thanks!).
The challenge is a variant of the coupon collector's problem. Its classical form gives for n1 = 1, n2 = 1, n3 = 14 an expected time of (1 +1/2 + 1/3 + … + 1/14) * 14 * 60 = 2731.312… Therefore 13 is an upper bound for n1, n2, n3.
If we find a formula for the expected duration, the rest can be done by applying the formula a couple of times.
Let Xn1, Xn2, Xn3 denote the random waiting time until players 1, 2, 3 are done.
The distribution of these random variables can be found as
where are the Stirling numbers of the second kind.
Now we compute the expectation for the game under consideration:
We can even avoid the infinite series by exchanging the summations over j and k:
The results are in minutes and must be multiplied by 60.
The closest result is 4 – 9 – 13, which gives an expected duration of about 2568.7246.
The '*' is for finding IBM in the solution 9 – 2 – 13.