Let r(n) count divisor pairs d_1 0, r(n)<epsilon tau(n) for almost every n?

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

Let $r(n)$ count divisor pairs $d_1<d_2<2d_1$ of $n$ . Is it true that for every $\epsilon>0$ , $r(n)<\epsilon\tau(n)$ for almost every $n$ ?

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).

Posted 1 month ago

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

No solutions have been posted yet.