A number theory problem by Dipto Biswas

If \(p\) is a prime number greater than 2, then find the remainder when \((1^{p} + 2^{p} + \cdots + p^{p})\) is divided by 2.

×

Problem Loading...

Note Loading...

Set Loading...