EulerFermatTheorem Challenging

Problem - 4235

(Fermat's little theorem) Show that $a^p\equiv a\pmod{p}$ holds if $p$ is a prime.


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error