When the sieve works. II

From MaRDI portal
Publication:2187300



Abstract: For a set of primes mathcalP, let Psi(x,mathcalP) be the number of positive integers nleqx all of whose prime factors lie in mathcalP. In this paper we classify the sets of primes mathcalP such that Psi(x,mathcalP) is within a constant factor of its expected value. This task was recently initiated by Granville, Koukoulopoulos and Matom"aki and their main conjecture is proved in this paper. In particular our main theorem implies that, if not too many large primes are sieved out in the sense that [ sum_{substack{p in mathcal{P} \ x^{1/v} < p leq x^{1/u}}} frac{1}{p} geq frac{1 + varepsilon}{u}, ] for some varepsilon>0 and vgequgeq1, then [ Psi(x, mathcal{P}) gg_{varepsilon, v} x prod_{substack{p leq x\ p otinmathcal{P}}} left(1 - frac{1}{p} ight). ]












This page was built for publication: When the sieve works. II

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