RO-TST 1990 Problem 6
Prove that there are infinitely many n's for which there exists a partition of into subsets such that for all , and prove that there are infinitely many 's for which there is no such partition.
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.