Claims

../

1964_01_01_erdos: In 1964 Erdős announced a proof that almost all integers have two divisors with ratio below one plus a negative power of log n, which contains the problem; the claim was withdrawn in his 1979 paper with Hall.

1984_02_01_maier_tenenbaum: Proves that for almost all n the closest pair of divisors of n has logarithmic ratio below a negative power of log n, so the integers with divisors d_1 < d_2 < 2 d_1 have density one.

---