← All problems

Erdős Problem #449 — Few nearby divisor pairs for almost every integer

46 years old · traced to

For each positive integer nn, let τ(n)\tau(n) be its number of positive divisors, and let r(n)r(n) count the pairs of positive divisors (d1,d2)(d_1,d_2) of nn satisfying d1<d2<2d1d_1<d_2<2d_1:

r(n)=#{(d1,d2):d1∣n, d2∣n, d1<d2<2d1}.r(n)=\#\{(d_1,d_2): d_1\mid n,\ d_2\mid n,\ d_1<d_2<2d_1\}.

The question is whether, for every real ϵ>0\epsilon>0, the exceptional integers have natural density zero; equivalently, whether

lim⁡X→∞1X#{n≤X:r(n)≥ϵτ(n)}=0.\lim_{X\to\infty}\frac{1}{X}\#\{n\le X:r(n)\ge \epsilon\tau(n)\}=0.

Erdős Problem #449

Background

Erdős and Graham posed this question in their 1980 Old and new problems and results in combinatorial number theory (p. 89). It asks whether divisor pairs whose ratio lies strictly between 11 and 22 form a vanishing proportion of all divisors for almost every integer. Erdős and Graham (1980), p. 89

Hall and Tenenbaum discuss an essentially identical problem in Section 4.6 of Divisors (1988), where the same Cauchy–Schwarz approach appears. Erdős Problem #449 Hall and Tenenbaum (1988)

References

P. Erdős and R. L. Graham, Old and new problems and results in combinatorial number theory, Monographies de L'Enseignement Mathématique 28 (1980).

Source: P. Erdős and R. L. Graham, Old and new problems and results in combinatorial number theory, Monographies de L'Enseignement Mathématique 28 (1980).

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.