Skip to main content
Conference Proceedings

An application of program derivation techniques to 18th-century mathematics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1422 44-51
DOI: 10.1007/bfb0054284
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Bijlsma, A. (1998). An application of program derivation techniques to 18th-century mathematics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1422, pp. 44–51). Springer Verlag. https://doi.org/10.1007/bfb0054284

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free