On the small sieve. I. Sifting by primes

DOI10.1016/0022-314X(80)90032-3zbMath0435.10028OpenAlexW2140029208WikidataQ105942337 ScholiaQ105942337MaRDI QIDQ1140117

Paul Erdős, Imre Z. Ruzsa

Publication date: 1980

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-314x(80)90032-3

zbMATH Keywords

small sievecoprime sifting setsifting by primes

Mathematics Subject Classification ID

Distribution of primes (11N05) Sieves (11N35)

Related Items

The compactness of distributions of a sequence of additive functions, Sur un problème de crible et ses applications, The convergence to the Poisson law. II: Unbounded strongly additive functions, Remarques sur un théorème de G. Halász et A. Sárközy, Sur les moments d'une fonction additive, Proof of a conjecture of Heath-Brown concerning quadratic residues, Arithmetical semigroups. II: Sieving by large and small prime elements. Sets of multiples

Cites Work

• Probabilistic Generalization of a Number-Theoretical Inequality
• Generalization of an inequality of Heilbronn and Rohrbach
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item