SE-SKOLORNAS 1980 Problem 2
, , , , , , and , , , , , , are two permutations of . Show that , , , , , , are not all different.
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.