olymmath

HMMT 2021 C5

  • Combinatorics

Teresa the bunny has a fair 8 -sided die. Seven of its sides have fixed labels 1,2,…,71,2, \ldots, 7, and the label on the eighth side can be changed and begins as 1 . She rolls it several times, until each of 1,2,…,71,2, \ldots, 7 appears at least once. After each roll, if kk is the smallest positive integer that she has not rolled so far, she relabels the eighth side with kk. The probability that 7 is the last number she rolls is ab\frac{a}{b}, where aa and bb are relatively prime positive integers. Compute 100a+b100 a+b.

Dataset text NuminaMath olympiads. Quoted with source.

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 hmmt/2021/c5 · Tag ET24VGHB29 · Edit this page on GitHub · Keys: j next, k previous