Journal of the American Mathematical Society · 1989 · 21 citations · 4 references
Natural SciencesMathematicsNumber TheoryProbability TheoryTheory Of ComputationCombinatorial Number TheorySieve MethodsArithmetic Progressions In Sets Of IntegersPrimes In Arithmetic ProgressionsUpper Bound Sieve
q<x'l' log-II x (q .a)=1-A In(x; q ,a) -n(x)!</J(q)1 :A x log x.This deals with essentially the same range of q as can be treated conditionally under GRH for individual progressions.For significantly larger q, the asymptotic formula is not known to hold, even in the above averaged sense, but there do follow by sieve methods upper bounds of the expected order of magnitude under the very mild restriction q < x 1- .Known as Brun-Titchmarsh theorems, these bounds hold both for the individual
4
Primes in arithmetic progressions to large moduli
Enrico Bombieri, John Friedlander, Henryk Iwaniec · Acta Mathematica · 1986 · 274 citations · Full text
Incomplete Kloosterman Sums and a Divisor Problem
John Friedlander, Henryk Iwaniec · Annals of Mathematics · 1985 · 104 citations
p+a without large prime factors.
Antal Balog · 1984 · 21 citations