When the sieve works

From MaRDI portal
(Redirected from Publication:498664)




Abstract: We are interested in classifying those sets of primes mathcalP such that when we sieve out the integers up to x by the primes in mathcalPc we are left with roughly the expected number of unsieved integers. In particular, we obtain the first general results for sieving an interval of length x with primes including some in (sqrtx,x], using methods motivated by additive combinatorics.









This page was built for publication: When the sieve works

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