benchmarks.wiki / Public workspace

Omni-MATH / Alice writes 1001 letters on a blackboard, each one chosen independently and…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

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?
Plain-text mathematical notation (without MathML)
Alice writes 1001 letters on a blackboard, each one chosen independently and uniformly at random from the set S={a,b,c}. A move consists of erasing two distinct letters from the board and replacing them with the third letter in S. What is the probability that Alice can perform a sequence of moves which results in one letter remaining on the blackboard?
Original LaTeX notation
Alice writes 1001 letters on a blackboard, each one chosen independently and uniformly at random from the set $S=\{a, b, c\}$. A move consists of erasing two distinct letters from the board and replacing them with the third letter in $S$. What is the probability that Alice can perform a sequence of moves which results in one letter remaining on the blackboard?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import