MODBasic EulerFermatTheorem Challenging

Problem - 4188

Show that a prime $p > 2$ is a sum of two squares if and only if $p\equiv 1\pmod{4}$.


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