World Library  
Flag as Inappropriate
Email this Article

Fermat's theorem on sums of two squares

Article Id: WHEBN0001850216
Reproduction Date:

Title: Fermat's theorem on sums of two squares  
Author: World Heritage Encyclopedia
Language: English
Subject: Euclidean algorithm, Reference desk/Archives/Mathematics/2015 June 2, Albert Girard, Additive number theory, Proof by infinite descent
Collection: Additive Number Theory, Theorems in Number Theory
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Fermat's theorem on sums of two squares

In additive number theory, Pierre de Fermat's theorem on sums of two squares states that an odd prime p is expressible as

p = x^2 + y^2,\,

with x and y integers, if and only if

p \equiv 1 \pmod{4}.

For example, the primes 5, 13, 17, 29, 37 and 41 are all congruent to 1 modulo 4, and they can be expressed as sums of two squares in the following ways:

5 = 1^2 + 2^2, \quad 13 = 2^2 + 3^2, \quad 17 = 1^2 + 4^2, \quad 29 = 2^2 + 5^2, \quad 37 = 1^2 + 6^2, \quad 41 = 4^2 + 5^2.

On the other hand, the primes 3, 7, 11, 19, 23 and 31 are all congruent to 3 modulo 4, and none of them can be expressed as the sum of two squares. This is the easier part of the theorem, and follows immediately from the observation that all squares are congruent to 0 or 1 modulo 4.

Albert Girard was the first to make the observation, describing all positive integral numbers (not necessarily primes) expressible as the sum of two squares of positive integers; this was published posthumously in 1634.[1] Fermat was the first to claim a proof of it; he announced this theorem in a letter to Marin Mersenne dated December 25, 1640: for this reason this theorem is sometimes called Fermat's Christmas Theorem.

Since the Brahmagupta–Fibonacci identity implies that the product of two integers each of which can be written as the sum of two squares is itself expressible as the sum of two squares, by applying Fermat's theorem to the prime factorization of any positive integer n, we see that if all the prime factors of n congruent to 3 modulo 4 occur to an even exponent, then n is expressible as a sum of two squares. The converse also holds.[2] This equivalence provides the characterization Girard guessed.

Contents

  • Proofs of Fermat's theorem on sums of two squares 1
  • Related results 2
  • See also 3
  • Notes 4
  • References 5

Proofs of Fermat's theorem on sums of two squares

Fermat usually did not write down proofs of his claims, and he did not provide a proof of this statement. The first proof was found by Euler after much effort and is based on infinite descent. He announced it in two letters to Goldbach, on May 6, 1747 and on April 12, 1749; he published the detailed proof in two articles (between 1752 and 1755).[3][4] Lagrange gave a proof in 1775 that was based on his study of quadratic forms. This proof was simplified by Gauss in his Disquisitiones Arithmeticae (art. 182). Dedekind gave at least two proofs based on the arithmetic of the Gaussian integers. There is an elegant proof using Minkowski's theorem about convex sets. Simplifying an earlier short proof due to Heath-Brown (who was inspired by Liouville's idea), Zagier presented a one-sentence proof of Fermat's assertion.[5]

Related results

Fermat announced two related results fourteen years later. In a letter to Blaise Pascal dated September 25, 1654 he announced the following two results for odd primes p:

  • p = x^2 + 2y^2 \Leftrightarrow p\equiv 1\mbox{ or }p\equiv 3\pmod{8},
  • p= x^2 + 3y^2 \Leftrightarrow p\equiv 1 \pmod{3}.

He also wrote:

If two primes which end in 3 or 7 and surpass by 3 a multiple of 4 are multiplied, then their product will be composed of a square and the quintuple of another square.

In other words, if p, q are of the form 20k + 3 or 20k + 7, then pq = x2 + 5y2. Euler later extended this to the conjecture that

  • p = x^2 + 5y^2 \Leftrightarrow p\equiv 1\mbox{ or }p\equiv 9\pmod{20},
  • 2p = x^2 + 5y^2 \Leftrightarrow p\equiv 3\mbox{ or }p\equiv 7\pmod{20}.

Both Fermat's assertion and Euler's conjecture were established by Lagrange.

See also

Notes

  1. ^ L. E. Dickson, History of the Theory of Numbers, Vol. II, Ch. VI, p. 227.
  2. ^ For a proof of the converse see for instance 20.1, Theorems 367 and 368, in: G.H. Hardy and E.M. Wright. An introduction to the theory of numbers, Oxford 1938.
  3. ^ De numerus qui sunt aggregata quorum quadratorum. (Novi commentarii academiae scientiarum Petropolitanae 4 (1752/3), 1758, 3-40)
  4. ^ Demonstratio theorematis FERMATIANI omnem numerum primum formae 4n+1 esse summam duorum quadratorum. (Novi commentarii academiae scientiarum Petropolitanae 5 (1754/5), 1760, 3-13)
  5. ^  .

References

  • L. E. Dickson. History of the Theory of Numbers Vol. 2. Chelsea Publishing Co., New York 1920
  • Stillwell, John. Introduction to Theory of Algebraic Integers by Richard Dedekind. Cambridge University Library, Cambridge University Press 1996. ISBN 0-521-56518-9
  • D. A. Cox (1989). Primes of the Form x2 + ny2. Wiley-Interscience.  
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.