KöMaL 2011 C1078
Define words'' as strings of at most ten characters made out of the 26 letters of the English alphabet. (A word'' may as well consist of a single letter, and two words'' are considered different if they differ in at least one letter.) Prove that the number of all possible words'' obtained in this way is divisible by 27.
Official text KöMaL. 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.