olymmath

HMMT November 2013 T2

  • Team
  • Answer

Gary plays the following game with a fair nn-sided die whose faces are labeled with the positive integers between 1 and nn, inclusive: if n=1n=1, he stops; otherwise he rolls the die, and starts over with a kk-sided die, where kk is the number his nn-sided die lands on. (In particular, if he gets k=1k=1, he will stop rolling the die.) If he starts out with a 6 -sided die, what is the expected number of rolls he makes?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

\frac{197}{60}

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmnt/2013/t2 · Tag KANHZJ9ZBV · Edit this page on GitHub · Keys: j next, k previous