# Hard divisibility problem [closed]

The statement of this problem is elementary... How about the proof ? Let $p$ be an odd prime number. For every integer $a$ , define the number

$S_{a}=\frac{a}{1}+\frac{a^{2}}{2}+....+\frac{a^{p-1}}{p-1}$.

Let $m$ and $n$ be integers such that $S_{3}+S_{4}-3S_{2}=\frac{m}{n}$. Prove that $p$ divides $m$.

-

## closed as off topic by Steven Landsburg, Chris Godsil, Felipe Voloch, Mark Sapir, Anthony QuasApr 29 '12 at 15:13

Questions on MathOverflow are expected to relate to research level mathematics within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here. If this question can be reworded to fit the rules in the help center, please edit the question.

I would like to see the proof. Voted to reopen. –  GH from MO Apr 29 '12 at 15:34
$S_a(p) \equiv ((a-1)^p + 1 - a^p)/p \bmod p$ [proof: expand $(a-1)^p$ in a binomial series, subtract first and last term, divide by $p$, and evaluate termwise]. So $S_3 + S_4 - 3S_2 \equiv (4 \cdot 2^p - 4 - 4^p)/p$. But that's $-(2^p-2)^2/p$, which is a multiple of $p$, QED. –  Noam D. Elkies Apr 29 '12 at 16:07
Well, the punchline is related with the fact that a nontrivial homomorphism from $({\bf Z}/p^2{\bf Z}, \times)$ to $({\bf Z}/p{\bf Z}, +)$ is given by $a \mapsto (a^{p-1}-1)/p$. (The formula for $S_a$ looks like a logarithm...) –  Noam D. Elkies Apr 29 '12 at 22:57
@Gerry: If I find a question interesting and nontrivial, then I like to see the answer for it. All this is highly subjective, I know. –  GH from MO Apr 29 '12 at 23:20
@Noam: Can you elaborate on your last comment? It sounds rather interesting. Thanks. –  GH from MO Apr 29 '12 at 23:21