Let $n$ be an even positive integer. Can one divide the numbers $1, ..., n$ into three nonempty groups, so that the sum of numbers in the first group is divisible by $n + 1$, in the second one by $n + 2$, and in the third one by $n + 3?$ For which odd integers would this be true?
Here is what I have so far:
1, 2, 3, 4, 5, 6, ... , n are the congruence classes for (n+1). So as n is even, we could re-write the classes as:
$1, 2, 3, 4,..., n/2, -n/2, -(n/2)-1, ..., -1 \equiv 0 \mod (n+1)$
$1, 2, 3, 4,..., (n+2)/2, -(n+2/2)-1, ..., -2 \equiv 2+(n/2) \mod (n+2)$
$1, 2, 3, 4,..., (n+2)/2, -(n+2/2), -(n+2/2)-1,..., -3 \equiv 2 \mod (n+3)$
Would this always be true? If not, how else would I approach the problem?
$$1+2+\cdots+(2n+1)=\frac{(2n+1)(2n+2)}2\\=(2n+2)+(n-3)(2n+3)+2(2n+4)$$ Set aside $1+(2n+1)$ for the first, and $4+5+(2n-1)+2n$ for the last.