SquareNumber MODBasic EulerFermatTheorem Challenging

Problem - 4190

(Two Squares Theorem) Show that a positive integer $n$ is a sum of two squares if and only if each prime factor $p$ of $n$ such that $p\equiv 3\pmod{4}$ occurs to an even power in the prime factorization of $n$.


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