Alternative proof for Fermat’s Two-Square Theorem

Proof.

Assume is an integer prime that is congruent to . Then Note does not divide either or . So is not a prime in . Then there exists a prime .

since are not associates where are integers

▮

Note we can find by Euclid’s algorithm.