Problem #WSP-000162

Prove that for an arbitrary odd $n = 2 m - 1$ the sum $S = 1^{n} + 2^{n} + . . . + n^{n}$ is divisible by $1 + 2 + . . . + n = n m$ .

To see the solution register and get verified.