An improved sieve of Eratosthenes
From MaRDI portal
Publication:5235102
DOI10.1090/mcom/3438zbMath1450.11122arXiv1712.09130OpenAlexW2962847573WikidataQ128231791 ScholiaQ128231791MaRDI QIDQ5235102
Publication date: 7 October 2019
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.09130
Number-theoretic algorithms; complexity (11Y16) Factorization; primality (11A51) Factorization (11Y05) Primality (11Y11)
Related Items (5)
Summing \(\mu(n)\): a faster elementary algorithm ⋮ Algorithms for the Multiplication Table Problem ⋮ Characterizing the supernorm partition statistic ⋮ Two algorithms to find primes in patterns ⋮ Tabulating Carmichael numbers \(n=Pqr\) with small \(P\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two fast parallel prime number sieves
- Disproof of the Mertens conjecture.
- Fast compact prime number sieves (among others)
- Prime sieves using binary quadratic forms
- Computations of the Mertens function and improved bounds on the Mertens conjecture
- Deterministic methods to find primes
- Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸
- Algorithmic Number Theory
This page was built for publication: An improved sieve of Eratosthenes
