badreferences Group Title For $$p>1$$, integer $$p$$ can only be prime iff$\sum_{i=1}^{p-1}i^{p-1}\equiv-1\pmod p$Prove? one year ago one year ago

Whoops, ahaha, fixed the TeX.

2. mukushla Group Title

*

3. experimentX Group Title

*

4. shubhamsrg Group Title

*

5. shubhamsrg Group Title

lol..

6. mathmate Group Title

Use fermat's little theorem. a^p = a which is equivalent to a^(p-1) = 1 Now proceed with the summation.