Question 3
You are given a set of $m$ positive integers such that they all give distinct remainders modulo some positive integer $n$. Prove that for any positive integer $k \leq m$ this set can be partitioned into $k$ nonempty subsets such that the sums of the numbers in these subsets are also distinct modulo $n$.