Erdős Problem #446 — Integers with divisors in a dyadic interval
For each positive integer , and positive integer , let
Define the natural densities, taken over positive integers , by
These limits exist: for fixed , the conditions are determined by divisibility by the finitely many integers in , hence describe finite unions of residue classes. Determine the asymptotic order of as . Is ? Erdős Problems #446 Ford, The distribution of integers with a divisor in a given interval (2008)
Background
This problem asks how often an integer has a divisor in a moving interval whose endpoints are comparable. The density is taken over the integers being tested, with the interval parameter fixed first; the asymptotic question then concerns that parameter tending to infinity. The problem sits within the broader study of integers with a divisor in a prescribed interval, which also has applications to the multiplication-table problem. Ford, The distribution of integers with a divisor in a given interval (2008) Ford, Integers with a divisor in (y, 2y) (2013)
The history of the dyadic interval begins with Besicovitch, who proved in 1934 that the lower limit of the density is zero, and Erdős, who proved in 1935 that it tends to zero. In 1960 Erdős obtained its logarithmic exponent. Tenenbaum later refined that estimate; Ford’s 2008 work determined the order of magnitude, including the secondary logarithmic factor. Erdős Problems #446 Ford, The distribution of integers with a divisor in a given interval (2008)
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).
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.