scientific article; zbMATH DE number 1305369
computation of arithmetic functionscomputational sievingfactoringGoldbach conjecturesimplementation of sieve algorithmsnumerical examplessieve of Eratosthenessurvey
Research exposition (monographs, survey articles) pertaining to number theory (11-02) Sieves (11N35) Applications of sieve methods (11N36) Goldbach-type theorems; other additive questions involving primes (11P32) Factorization (11Y05) Values of arithmetic functions; tables (11Y70) Computational number theory (11Yxx)
This is a well written survey paper on the part of computational number theory that requires the application of some sieve. The topics being covered are the sieve of Eratosthenes and its generalisations, the Goldbach conjectures, factoring and the computation of arithmetic functions by sieving. With suitable numerical examples illustrating the ideas involved, it is explained how such sieve algorithms can be implemented efficiently on modern machines. For the entire collection see [Zbl 0911.00018].
- A representation of large integers from combinatorial sieves
- scientific article; zbMATH DE number 4168803 (Why is no real title available?)
- A higher-dimensional sieve method. With procedures for computing sieve functions
- scientific article; zbMATH DE number 66939 (Why is no real title available?)
- scientific article; zbMATH DE number 1303173 (Why is no real title available?)
- scientific article; zbMATH DE number 1014825 (Why is no real title available?)
- scientific article; zbMATH DE number 917769 (Why is no real title available?)
- An improved sieve of Eratosthenes
- Sieving Procedures on a Digital Computer
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252247)