HMMT 2023 U30
- Guts
- Answer
Five pairs of twins are randomly arranged around a circle. Then they perform zero or more swaps, where each swap switches the positions of two adjacent people. They want to reach a state where no one is adjacent to their twin. Compute the expected value of the smallest number of swaps needed to reach such a state.
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
\frac{926}{945}
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.