Abstract
Which numbers can be written as sums of two squares? This question is as old as number theory, and its solution is a classic in the field. The “hard” part of the solution is to see that every prime number of the form 4m + 1 is a sum of two squares. G. H. Hardy writes that this two square theorem of Fermat “is ranked, very justly, as one of the finest in arithmetic. ”Nevertheless, one of our Book Proofs below is quite recent.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aigner, M., Ziegler, G.M. (2014). Representing numbers as sums of two squares. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44205-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-44205-0_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44204-3
Online ISBN: 978-3-662-44205-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)