Abstract
Program derivation methodology is applied to reconstruct Euler's proof that every prime congruent to 1 modulo 4 is the sum of two squares.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
H. Davenport, The higher arithmetic, 6th ed. Cambridge University Press, 1992.
L.E. Dickson, History of the theory of numbers, vol. II. Carnegie Institute, ashington, 1919. Repr. Chelsea, New York, 1966.
E.W. Dijkstra, A derivation of a proof by D. Zagier. EWD1154, August 1993.
L. Euler, ‘Novae demonstrationes circa resolutionem numerorum in quadrata'. Acta Eruditorium Lipsiae (1773), 193.
A. Girard (ed.), L'Arithmétique de Simon Stevin. Leiden, 1625.
J.L. Lagrange, ‘Démonstration d'un théorème nouveau concernant les nombres premiers', Nouv. Mém. Acad. Roy. Berlin 2 (1773), 125–337.
Author information
Authors and Affiliations
Editor information
Additional information
Dedicated to Prof. Dr F.E.J. Kruseman Aretz
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bijlsma, A. (1998). An application of program derivation techniques to 18th-century mathematics. In: Jeuring, J. (eds) Mathematics of Program Construction. MPC 1998. Lecture Notes in Computer Science, vol 1422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054284
Download citation
DOI: https://doi.org/10.1007/BFb0054284
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64591-7
Online ISBN: 978-3-540-69345-1
eBook Packages: Springer Book Archive