← All problems

Erdős Problem #277 — Abundancy ratios for noncovering integers

46 years old · traced to

For a positive integer mm, let σ(m)=∑d∣md\sigma(m)=\sum_{d\mid m}d. Call mm covering if one can choose a residue rd(modd)r_d\pmod d for each distinct divisor d>1d>1 of mm so that these residue classes cover Z\mathbb Z; otherwise call mm noncovering. For real x>1x>1, set

f(x)=max⁡m<x\m noncoveringσ(m)m.f(x)=\max_{\substack{m<x\m\text{ noncovering}}}\frac{\sigma(m)}{m}.

The question is whether

f(x)=o(log⁡log⁡x)(x→∞),f(x)=o(\log\log x)\qquad(x\to\infty),

that is, whether f(x)/log⁡log⁡xf(x)/\log\log x 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 11 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 σ(N)/N\sigma(N)/N could be arbitrarily large even when the divisors of NN 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 σ(H)/H>2\sigma(H)/H>2 when its moduli are divisors of HH, but a large divisor sum alone does not ensure that HH 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

Never refreshed

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.