Problem #WSP-000162

Problems Number Theory Divisibility Division with remainders. Arithmetic of remainders Division with remainder

Problem

Prove that for an arbitrary odd \(n = 2m - 1\) the sum \(S = 1^n + 2^n + ... + n^n\) is divisible by \(1 + 2 + ... + n = nm\).