SE-SKOLORNAS 1991 Problem 4
is a permutation of . A move is to take or and place it at the start to from a new sequence. Show that by a sequence of moves we can always arrive at .
Dataset text AI-MO AoPS. 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.
Similar problems
These problems have the most words in common with this statement.