EulerFermatTheorem Intermediate

Problem - 4268

Let $m$ and $n$ be positive integers, $m$ be odd, and $(m, 2^{n} - 1)=1$. Show that $\displaystyle\sum_{k=1}^{m}k^n$ is a multiple of $m$.


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error