7 | Sum/Difference Combination of 6 Integers
Source: ILL 1970 - Problem 12.
May 24, 2011
algebrapolynomialnumber theory unsolvednumber theory
Problem Statement
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.