HMMT 2009 C3
- Combinatorics
- Answer
In how many ways can you rearrange the letters of "HMMTHMMT" such that the consecutive substring "HMMT" does not appear?
Dataset text NuminaMath olympiads. Quoted with source.
Also HMMT 2009 F6.
Show the answer
361
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.