Euler’s E228: Primality Testing and Factoring via Sums of Squares

DOI10.1007/978-3-319-64551-3_7zbMath1391.01012OpenAlexW2777859453MaRDI QIDQ4609484

V. Frederick Rickey

Publication date: 3 April 2018

Published in: Proceedings of the Canadian Society for History and Philosophy of Mathematics/La Société Canadienne d’Histoire et de Philosophie des Mathématiques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-64551-3_7

zbMATH Keywords

primessums of squaresnumber theoryfactoringprimality testing

Mathematics Subject Classification ID

History of mathematics in the 18th century (01A50) History of number theory (11-03) Factorization; primality (11A51)

Cites Work

• Euler's work on number theory: a concordance for A. Weil's \textit{Number theory}
• Editor's Corner: The Euclidean Algorithm Strikes Again
• A One-Sentence Proof That Every Prime p≡1(\mod 4) Is a Sum of Two Squares
• Turning Euler's Factoring Method into a Factoring Algorithm
• Leonhard Euler
• Prime numbers and computer methods for factorization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Euler’s E228: Primality Testing and Factoring via Sums of Squares