INMO 1994 Problem 3
In any set of square integers, prove that one can always find a subset of numbers, sum of whose elements is divisible by .
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.