Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is it true that if $p\neq5$ is a prime number then $1^p+2^{p-1}+\cdots+(p-1)^2+p^1\not\equiv0\pmod p$?

If $p=5$ then $1^5+2^4+3^3+4^2+5^1\equiv0\pmod 5,$ but there is no such prime $p\leq40000$ any more, can you prove it or give a counterexample?

PS: If $p>5$ could be a composite number, then $p\in \{16,208,688,784,2864,9555\cdots\}$ also works.

share|cite|improve this question
The naive heuristic argument says that there should be infinitely many primes with the sum congruent to 0 but this could be quite hard to prove because they're distributed very sparsely; you should only expect roughly three instances with $p\lt 10^6$! For related discussion, see… and… . – Steven Stadnicki Jul 29 '13 at 6:37
up vote 5 down vote accepted

$p=81239$ is a counterexample.

share|cite|improve this answer
How did you come up with this? – Kunnysan Jul 30 '13 at 7:42
@Kunnysan Just a brute-force search, nothing sophisticated. – Zander Jul 30 '13 at 11:18

This sounds like a $\sum\frac 1p$ distribution, similar to "If $p \mid 10^x-1$ then so does $p^2$". This has solutions for $3$, $487$, and $56598313$, and no other values under $120^4$.

One just has to go out and have a look.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.