Erdős Problem #486 — Logarithmic density of survivor sets
Let , let , and, for each , let be an arbitrary subset of the residue ring . Define the survivor set by
Thus a congruence condition modulo excludes integers in the selected residue classes only after the strict activation threshold . Must every such choice of and give a logarithmic density; that is, does the limit
exist? Erdős Problems #486
Background
This question belongs to the theory of congruence sieves and primitive sets. Its classical divisibility model takes , so integers are removed when divisible by an earlier selected modulus. Davenport and Erdős established a logarithmic-density theorem for the corresponding set of multiples, and their 1951 paper gave an elementary proof. Erdős recorded the broader question in his work on primitive sets. Erdős Problems #486 Davenport and Erdős (1951), On sequences of positive integers
Logarithmic density is the natural target here partly because ordinary density can fail even in the divisibility model: Besicovitch produced examples without natural density. The question also extends the one-residue-per-modulus case, allowing each modulus to exclude an arbitrary collection of residue classes. Related truncated-sieve work studies one selected residue class at each of a strictly increasing sequence of moduli, but uses its own activation convention and does not by itself settle this more general question. Erdős Problems #486 Davenport and Erdős (1951), On sequences of positive integers Chojecki (2026), Truncated Congruence Sieves and Erdős Problem 25
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.