Fermat’s Christmas Theorem Prof. Stephen DeBacker Abstract Fermat's Christmas Theorem (25 December, 1640) is the incredibly beautiful statement that an odd prime may be written as the sum of two squares if and only if it is one more than a multiple of four. As with his famous last theorem, Fermat stated, but did not prove, this theorem. Many of the greats (e.g., Euler, Gauss, Dedekind) produced proofs of the Christmas Theorem. In this talk, we will discuss an approach to the problem via that most elementary of all number-theoretic concepts: the Euclidean Algorithm.
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Fermat’s Christmas Theorem
Prof. Stephen DeBacker
Abstract
Fermat's Christmas Theorem (25 December, 1640) is the incredibly beautiful statement that an odd prime may be written as the sum of two squares if and only if it is one more than a multiple of four. As with his famous last theorem, Fermat stated, but did not prove, this theorem. Many of the greats (e.g., Euler, Gauss, Dedekind) produced proofs of the Christmas Theorem. In this talk, we will discuss an approach to the problem via that most elementary of all number-theoretic concepts: the Euclidean Algorithm.
Related Documents
![CYCLOTOMIC FIELDS AND FERMAT’S LAST THEOREM...CYCLOTOMIC FIELDS AND FERMAT’S LAST THEOREM 5 Now for the main argument. Inside Z[ ] we may factor xp+ yp= pY1 i=0 (x+ y i): We claim](https://static.cupdf.com/doc/110x72/5edc7c1aad6a402d6667291a/cyclotomic-fields-and-fermatas-last-theorem-cyclotomic-fields-and-fermatas.jpg)
