A Quixotic Proof of Fermat's Two Squares Theorem for Prime Numbers

2022/10/14 by Bacher, Roland · 1 citation
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2210.07657

Abstract

Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two squares.

Cited by

• An Unimaginative Proof of Fermat's Two Squares Theorem

Related

• Yet another Proof of an old Hat
• Sums of Two Squares Visualized
• On sums of unequal powers of primes and powers of 2
• Representing Integers as the Sum of Two Squares in the Ring \Z_n
• Continuants and some decompositions into squares