A prime testing algorithm from Leonhard Euler

DOI10.1080/00029890.2021.1943118MaRDI QIDQ3379604zbMATH OpenOpenAlexFDO

Authors Dominic Klyve, Erik R. Tou

Publication date 27 September 2021

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00029890.2021.1943118

Mathematics Subject Classification ID

History of mathematics in the 18th century (01A50) History of number theory (11-03) Sums of squares and representations by other particular quadratic forms (11E25) Primality (11Y11)

Recommendations

• Euler's E228: primality testing and factoring via sums of squares
• Early study in which Leonhard Euler made use of the mathematical analysis to the research of number theory
• Euler pseudoprime polynomials and strong pseudoprime polynomials
• scientific article; zbMATH DE number 1942863
• scientific article; zbMATH DE number 501128

Cites work

• scientific article; zbMATH DE number 45834 (Why is no real title available?)
• Correspondence of Leonhard Euler with Christian Goldbach. Part II. Edited by Martin Mattmüller and Franz Lemmermeyer
• Idoneal numbers and some generalizations
• Number theory. An approach through history from Hammurapi to Legendre

Cited in

(3)

• Quick, does 23/67 equal 33/97? A mathematician's secret from Euclid to today
• scientific article; zbMATH DE number 733562 (Why is no real title available?)
• Euler's E228: primality testing and factoring via sums of squares

This page was built for publication: A prime testing algorithm from Leonhard Euler

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