KöMaL 2007 B4024
How many numbers can be selected out of the first 1000 positive integers at most, so that the sum of no pair of selected numbers is divisible by their difference.
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.