← All problems

Erdős Problem #964 — Dense ratios of consecutive divisor counts

40 years old · traced to

For a positive integer mm, let τ(m)\tau(m) be the number of its positive divisors. Is the set of ratios

{τ(n+1)τ(n):n∈Z≥1}\left\{\frac{\tau(n+1)}{\tau(n)}:n\in\mathbb{Z}_{\ge 1}\right\}

dense in (0,∞)(0,\infty)? Equivalently, for every real x>0x>0 and every ε>0\varepsilon>0, is there a positive integer nn such that

∣τ(n+1)τ(n)−x∣<ε?\left|\frac{\tau(n+1)}{\tau(n)}-x\right|<\varepsilon?

Erdős (1986)

Background

Erdős posed the density question in 1986. The generalized prime kk-tuple conjecture would imply the stronger assertion that every positive rational is attained infinitely many times. An unconditional approach was developed by Eberhard, building on an idea of Hasanalizade and related work of Schlage-Puchta. Eberhard (2026)

The key ingredient is a sieve theorem of Goldston, Graham, Pintz, and Yıldırım. Given positive integers ai,ria_i,r_i for 1≤i≤31\le i\le 3 satisfying (ri,ai)=(ri,ai−aj)=(ri,rj)=1(r_i,a_i)=(r_i,a_i-a_j)=(r_i,r_j)=1 for i≠ji\ne j, set Li(x)=aix+1L_i(x)=a_i x+1. For any positive integer CC, the theorem gives a pair i<ji<j for which infinitely many positive integers xx have both Li(x)/riL_i(x)/r_i and Lj(x)/rjL_j(x)/r_j equal to products of two distinct primes greater than CC. Choosing three consecutive coefficients makes the corresponding linear forms differ by fixed small integer combinations. The large prime factors then leave the divisor counts in the resulting consecutive integers controlled by the fixed coefficients and the chosen rir_i, allowing the sieve output to produce prescribed ratios. Goldston, Graham, Pintz, and Yıldırım (2011) Eberhard (2026)

References

P. Erdős, Some problems on number theory, Proceedings of the Seventeenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (1986), 225–244.

Source: P. Erdős, Some problems on number theory, Proceedings of the Seventeenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (1986), 225–244.

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.