Erdős Problem #277 — Abundancy ratios for noncovering integers
For a positive integer , let . Call covering if one can choose a residue for each distinct divisor of so that these residue classes cover ; otherwise call noncovering. For real , set
The question is whether
that is, whether tends to zero. Erdős (1980) Erdős Problems #277
Background
A covering system is a finite collection of congruence classes whose union contains every integer. The divisor question concerns whether the distinct divisors greater than of an integer can serve as the moduli of such a system, with one residue class chosen for each modulus. Erdős placed this question among broader problems on covering congruences. He conjectured that the ratio could be arbitrarily large even when the divisors of do not form a covering system; Haight proved that conjecture, prompting the extremal function above. Related work also shows that a covering system with distinct moduli must have when its moduli are divisors of , but a large divisor sum alone does not ensure that is covering. Erdős (1980) Sieving by large integers and covering systems of congruences
References
P. Erdős, A survey of problems in combinatorial number theory, Ann. Discrete Math. 6 (1980), 89-115.
Source: P. Erdős, A survey of problems in combinatorial number theory, Ann. Discrete Math. 6 (1980), 89-115.
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.