HMMT 2023 C3
- Combinatorics
- Answer
Richard starts with the string HHMMMMTT. A move consists of replacing an instance of HM with MH , replacing an instance of MT with TM, or replacing an instance of TH with HT. Compute the number of possible strings he can end up with after performing zero or more moves.
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
70
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.