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

DOI10.1080/00029890.2023.2242034arXiv2210.07657OpenAlexW4306246861WikidataQ122182796 ScholiaQ122182796MaRDI QIDQ6063427

Roland Bacher

Publication date: 7 November 2023

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.07657

zbMATH Keywords

latticesVoronoi cellsFermat's two squares theorem

Mathematics Subject Classification ID

Primes (11A41)

Related Items (1)

Euclid meets Popeye: the Euclidean algorithm for \(2\times 2\) matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A partition-theoretic proof of Fermat's two squares theorem
• A Combinatorial Approach to Sums of Two Squares and Related Problems
• A One-Sentence Proof That Every Prime p≡1(\mod 4) Is a Sum of Two Squares

This page was built for publication: A Quixotic Proof of Fermat’s Two Squares Theorem for Prime Numbers