Any classical sifting problem equipped with a Bombieri-Vinogradov error term can be made fully effective by adjusting the sieve bounds to avoid Siegel-zero complications, preserving the original asymptotic form.
Primes in arithmetic progressions to large moduli, and Goldbach beyond the square-root barrier
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.NT 3representative citing papers
Under GRH the Linnik-Goldbach problem is solved with six powers of two; unconditionally more than 25 percent of odd integers are a prime plus a power of two.
citing papers explorer
-
An effective Bombieri-Vinogradov error term for sifting problems
Any classical sifting problem equipped with a Bombieri-Vinogradov error term can be made fully effective by adjusting the sieve bounds to avoid Siegel-zero complications, preserving the original asymptotic form.
-
An update on the Linnik--Goldbach and Romanov problems
Under GRH the Linnik-Goldbach problem is solved with six powers of two; unconditionally more than 25 percent of odd integers are a prime plus a power of two.
- Primes in arithmetic progressions to large moduli and refinements of Harman's sieve