olymmath

CMO 2004 Problem 4

  • Paper
  • Answer

Let pp be an odd prime. Prove that

∑k=1p−1k2p−1≡p(p+1)2( mod p2)\sum_{k=1}^{p-1} k^{2 p-1} \equiv \frac{p(p+1)}{2} \left(\bmod p^{2}\right)

[Note that a≡b( mod m)a \equiv b(\bmod m) means that a−ba-b is divisible by mm.]

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

\frac{p(p+1)}{2}

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator ca-cmo/2004/p4 · Tag 1QQQ7EJEKB · Edit this page on GitHub · Keys: j next, k previous