Divide {1,2,...,2010} in subsets - Argentina TST 2010
Source:
May 3, 2010
algebrapolynomialinductioncombinatorics unsolvedcombinatorics
Problem Statement
Suppose are integers with for all such that .
Prove that the set can be partitioned in subsets each with elements respectively, such that the sum of the numbers on each subset is divisible by .
Decide whether this property still holds if we replace by and by (that is, if the set to be partitioned is ).