OPENHARDnumber theoryprimes
Are there infinitely many primes $p$ such that every even number $n\leq p-3$ can be written as a difference of primes $n=q_1-q_2$ where $q_1,q_2\leq p$?
Notes: The first prime lacking this property is 97. Elsholtz improved the counting bound to << x * exp(-c(log log x)^2) for c < 1/8.
AI Status: NONE · 0 total attempts