Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 693

../


Statement. Let k≥2k\geq 2 and nn be sufficiently large depending on kk. Let A={a1<a2<⋯ }A=\{a_1<a_2<\cdots \} be the set of those integers in [n,nk][n,n^k] which have a divisor in (n,2n)(n,2n). Estimate

max⁡iai+1−ai.\max_{i} a_{i+1}-a_i.

Is this ≤(log⁡n)O(1)\leq (\log n)^{O(1)}?

Status. Open.

Source. erdosproblems.com/693, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #693, https://www.erdosproblems.com/693.

Formalization. None recorded.

Progress

Not yet compiled.

Known Results

Not yet compiled.