KöMaL 2010 A506
Prove that for every prime , there exists a colouring of the positive integers with -1 colours such that the colours of the numbers { ,2,3,...,(-1) } are pairwise different for every positive integer .
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.