olymmath

HMMT 2020 C6

  • Combinatorics

Alice writes 1001 letters on a blackboard, each one chosen independently and uniformly at random from the set S={a,b,c}S=\{a, b, c\}. A move consists of erasing two distinct letters from the board and replacing them with the third letter in SS. What is the probability that Alice can perform a sequence of moves which results in one letter remaining on the blackboard?

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/2020/c6 · Tag 4WFMCPQC3V · Edit this page on GitHub · Keys: j next, k previous