Problem:
Dave rolls a fair six-sided die until a six appears for the first time. Independently, Linda rolls a fair six-sided die until a six appears for the first time. Let m and n be relatively prime positive integers such that nmβ is the probability that the number of times Dave rolls his die is equal to or within one of the number of times Linda rolls her die. Find m+n.
Solution:
The probability that Dave or Linda rolls a die k times to get the first six is the probability that there are kβ1 rolls which are not six followed by one roll of six, which is pkβ=(65β)kβ1(61β). The probability that Dave will need one roll and Linda will need one or two rolls is then p1β(p1β+p2β). The probability that Dave will need k>1 rolls and Linda will need kβ1,k, or k+1 rolls is then pkβ(pkβ1β+pkβ+pk+1β). It follows that the desired probability is p1β(p1β+p2β)+βk=2ββpkβ(pkβ1β+pkβ+pk+1β). This is
β61ββ
(61β+65ββ
61β)+k=2βββ(65β)kβ1(61β)((65β)kβ2(61β)+(65β)kβ1(61β)+(65β)k(61β))=(61β)β
(366β+365β)+k=2βββ(65β)kβ1(61β)(65β)kβ2(61β)(1+(65β)+(65β)2)=6311β+6491ββ
1β(65β)265ββ=6311β+6391ββ
115β=63β
11576β=338β.β
Thus the final answer is 8+33=41β.
The problems on this page are the property of the MAA's American Mathematics Competitions