ILL 1970 Problem 12
Let be a given set of six integers, none of which are divisible by . Prove that at least one of the expressions of the form is divisible by , where the signs are independent of each other. Generalize the result to every prime number.
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.