Erdős Problem #964 — Dense ratios of consecutive divisor counts
For a positive integer , let be the number of its positive divisors. Is the set of ratios
dense in ? Equivalently, for every real and every , is there a positive integer such that
Background
Erdős posed the density question in 1986. The generalized prime -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 for satisfying for , set . For any positive integer , the theorem gives a pair for which infinitely many positive integers have both and equal to products of two distinct primes greater than . 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 , 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.
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.