Running Sum Hits a Multiple of Six
A fair six-sided die is rolled repeatedly, and the results are summed as the rolls accumulate. Find the expected number of rolls needed until this running total is first a multiple of six.
Work it out, then compare with the answer.
SolutionShow the worked solution
Key idea. Whatever the running total is, exactly one face makes the new total a multiple of six.
Let and . Fix and condition on . Then for some known . The new total is divisible by exactly when .
The faces cover every residue mod exactly once, so exactly one face does this. Since is independent of the earlier rolls,
This holds whatever the history. In particular it holds on the event , which is determined by . Hence , and by induction .
So , and
Variations
The same idea with a twist. Each solution gives only the changed step.
A fair six-sided die is rolled repeatedly, and the results are summed as the rolls accumulate. Find the expected number of rolls needed until this running total is first even.
Work it out, then compare with the answer.
Solution
The same argument applies with parity in place of residues mod . Whatever the parity of , exactly three of the six faces make even: even faces if is even, odd faces if it is odd. Each roll therefore succeeds with conditional probability regardless of the past.
Hence and . Conditioning on the first roll gives the same result: .