CAPS 2022 Problem 6
Consider 26 letters . A string is a finite sequence consisting of those letters. We say that a string is nice if it contains each of the 26 letters at least once, and each permutation of letters occurs in as a subsequences the same number of times. Prove that: (a) There exists a nice string. (b) Any nice string contains at least letters.
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.