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

DOI10.1007/BFB0054284MaRDI QIDQ4213377zbMATH OpenFDO

Authors A. Bijlsma

Publication date 29 November 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/19431

zbMATH Keywords

program derivationrepresentations of primessums of squares

Mathematics Subject Classification ID

Goldbach-type theorems; other additive questions involving primes (11P32) Computational number theory (11Y99) Specification and verification (program logics, model checking, etc.) (68Q60)

Review text

Let \(p\) be prime, \(p\equiv 1\pmod 4\). The author uses the methodology of program derivation to obtain \(a,b\) such that \(p= a^2+b^2\). As usual he begins by finding \(x\) such that \(x\equiv ((p-1)/2)!\pmod p\). It is noted that the method gives a constructive factorization (in \(K(i)\)). For the entire collection see [Zbl 0891.00027].

Recommendations

• Editor's Corner: The Euclidean Algorithm Strikes Again
• Algorithm for factoring primes in quadratic number fields in special cases
• scientific article; zbMATH DE number 3007849
• scientific article; zbMATH DE number 1122843

Cited in

(1)

• Editor's Corner: The Euclidean Algorithm Strikes Again

This page was built for publication: An application of program derivation techniques to 18th-century mathematics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4213377)