← All problems

Erdős Problem #886 — Divisors in short intervals near square root

29 years old · traced to

For a positive integer nn and a real number xx, let Dn(x)D_n(x) count the positive integer divisors of nn in the specified interval. The question is whether, for every fixed real ϵ>0\epsilon>0, there exist constants KϵK_\epsilon and NϵN_\epsilon such that every integer n≥Nϵn\ge N_\epsilon satisfies

Dn((n1/2,n1/2+n1/2−ϵ))=#{d∈Z>0:d∣n, n1/2<d<n1/2+n1/2−ϵ}≤Kϵ.D_n\bigl((n^{1/2},n^{1/2}+n^{1/2-\epsilon})\bigr) =\#\{d\in\mathbb Z_{>0}:d\mid n,\ n^{1/2}<d<n^{1/2}+n^{1/2-\epsilon}\}\le K_\epsilon.

The interval is open at both ends, and the bound may depend on ϵ\epsilon but not on nn. This is attributed to Ruzsa. Erdős Problems #886

Background

Divisors just above n\sqrt n correspond, by pairing dd with n/dn/d, to factor pairs of nn whose two factors are close to one another. Thus the question asks for a uniform bound on how many such factors can cluster in a shrinking interval next to the square root. Erdős and Rosenfeld proved that there are infinitely many nn with four divisors in (n,n+16n1/4)(\sqrt n,\sqrt n+16n^{1/4}), while also proving that for every fixed C>0C>0, all sufficiently large nn have at most 1+C21+C^2 divisors in the closed interval [n,n+Cn1/4][\sqrt n,\sqrt n+Cn^{1/4}]. Erdős Problems #886

References

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.