Divisibility of power sums and the generalized Erdős-Moser equation (Q1941570)

For \(k\) an integer, let \(\nu_2(k)\) denote the highest exponent \(\nu\) such that \(2^{\nu}\) divides \(k\). Given positive integers \(m\) and \(n\) the authors relate, using induction, \(\nu_2(1^n+2^n+\cdots+m^n)\) to \(\nu_2(m(m+1)/2)\). They apply this result to give an easy reproof of the result of the reviewer [Bull. Aust. Math. Soc. 53, No. 2, 281--292 (1996; Zbl 0851.11020)] that if \(1^n+2^n+\cdots+(m-1)^n=am^n\), then \(m\) must be odd.