The Sieve Problem for All-Purpose Computers

DOI10.2307/2002562MaRDI QIDQ5818826zbMATH OpenOpenAlexFDO

Authors D. H. Lehmer

Publication date 1953

Published in Mathematical Tables and Other Aids to Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2002562

zbMATH Keywords

numerical analysis

Cited in

(8)

• Reading Gauss in the computer age: On the U.S. Reception of Gauss's number theoretical work (1938-1989)
• Ein Verfahren zur Primfaktorzerlegung großer Zahlen mit Hilfe binärer quadrati\-scher Formen
• A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC
• A Very High-Speed Digital Number Sieve
• A New Factorization Technique Using Quadratic Forms
• Improved primality proving with Eisenstein pseudocubes
• New Proof of the Generalized Chinese Remainder Theorem
• Number crunching vs. number theory: computers and FLT, from Kummer to SWAC (1850--1960), and beyond

This page was built for publication: The Sieve Problem for All-Purpose Computers

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