A One-Sentence Proof That Every Prime p≡1(\mod 4) Is a Sum of Two Squares
From MaRDI portal
Publication:3982584
DOI10.2307/2323918zbMath0735.11014OpenAlexW4252703028WikidataQ55872429 ScholiaQ55872429MaRDI QIDQ3982584
Publication date: 26 June 1992
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2323918
Sums of squares and representations by other particular quadratic forms (11E25) Quadratic and bilinear Diophantine equations (11D09)
Related Items (17)
Prime numbers \(p\) with expression \(p=a^2\pm ab\pm b^2\) ⋮ Note on an analogue of Fermat's two squares theorem for primes p ≡ 3(mod8) ⋮ Partition bijections, a survey ⋮ Mathematical method and proof ⋮ Elementary geometry on the integer lattice ⋮ Deus ex machina and the aesthetics of proof ⋮ On primitive solutions of the Diophantine equation \(x^2 + y^2 = M\) ⋮ A Quixotic Proof of Fermat’s Two Squares Theorem for Prime Numbers ⋮ Proving quadratic reciprocity: explanation, disagreement, transparency and depth ⋮ Computers as a novel mathematical reality. II: Waring's problem ⋮ A partition-theoretic proof of Fermat's two squares theorem ⋮ Euler’s E228: Primality Testing and Factoring via Sums of Squares ⋮ A Short Proof of Fermat’s Two-square Theorem ⋮ Abelian groups and quadratic residues in weak arithmetic ⋮ On a sphere that passes through \(n\) lattice points ⋮ A simple evaluation of a theta value, the Kronecker limit formula and a formula of Ramanujan ⋮ Pythagorean Boxes and Quotients of Gaussian Integers
This page was built for publication: A One-Sentence Proof That Every Prime p≡1(\mod 4) Is a Sum of Two Squares
