Euler's E228: primality testing and factoring via sums of squares

DOI10.1007/978-3-319-64551-3_7zbMATH Open1391.01012OpenAlexW2777859453MaRDI QIDQ4609484FDOQ4609484

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1942863
• scientific article; zbMATH DE number 3763880
• Correspondence of Leonhard Euler with Christian Goldbach. Part II. Edited by Martin Mattmüller and Franz Lemmermeyer
• A prime testing algorithm from Leonhard Euler
• Euler, Goldbach, and ``Fermat's theorem

zbMATH Keywords

primessums of squaresfactoringnumber theoryprimality testing

Mathematics Subject Classification ID

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

Cites Work

• A One-Sentence Proof That Every Prime p≡1(\mod 4) Is a Sum of Two Squares
• Title not available (Why is that?)
• Title not available (Why is that?)
• Prime numbers and computer methods for factorization
• Leonhard Euler
• Euler's work on number theory: a concordance for A. Weil's \textit{Number theory}
• Factor tables 1657--1817, with notes on the birth of number theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Editor's Corner: The Euclidean Algorithm Strikes Again
• Turning Euler's Factoring Method into a Factoring Algorithm

Cited In (3)

• Václav Šimerka: quadratic forms and factorization
• The completion of Euler's factoring formula
• Title not available (Why is that?)

This page was built for publication: Euler's E228: primality testing and factoring via sums of squares

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