Proofs of Fermat's Theorem On Sums of Two Squares

Proofs Of Fermat's Theorem On Sums Of Two Squares

Fermat's theorem on sums of two squares asserts that an odd prime number p can be expressed as

with integer x and y if and only if p is congruent to 1 (mod 4). The statement was announced by Fermat in 1640, but he supplied no proof.

The "only if" clause is easy: a perfect square is congruent to 0 or 1 modulo 4, hence a sum of two squares is congruent to 0, 1, or 2. An odd prime number is congruent to either 1 or 3 modulo 4, and the second possibility has just been ruled out. The first proof that such a representation exists was given by Leonhard Euler in 1747 and was quite complicated. Since then, many different proofs have been found. Among them, the proof using Minkowski's theorem about convex sets and Don Zagier's stunningly short proof based on involutions especially stand out.

Read more about Proofs Of Fermat's Theorem On Sums Of Two Squares:  Euler's Proof By Infinite Descent, Lagrange's Proof Through Quadratic Forms, Dedekind's Two Proofs Using Gaussian Integers, Zagier's "one-sentence Proof", References

Famous quotes containing the words proofs of, proofs, theorem, sums and/or squares:

    I do not think that a Physician should be admitted into the College till he could bring proofs of his having cured, in his own person, at least four incurable distempers.
    Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)

    Trifles light as air
    Are to the jealous confirmation strong
    As proofs of holy writ.
    William Shakespeare (1564–1616)

    To insure the adoration of a theorem for any length of time, faith is not enough, a police force is needed as well.
    Albert Camus (1913–1960)

    If God lived on earth, people would break his windows.
    Jewish proverb, quoted in Claud Cockburn, Cockburn Sums Up, epigraph (1981)

    An afternoon of nurses and rumours;
    The provinces of his body revolted,
    The squares of his mind were empty,
    Silence invaded the suburbs,
    —W.H. (Wystan Hugh)