Erdős Problem #17 — Primes below which every even number is a difference of primes
A purely computational problem (this problem cannot be attacked by other means at present). Call a prime good if every even number can be written in the form where , are primes. Are there infinitely many good primes?
References
P. Erdős, Some of my favourite problems in number theory, combinatorics, and geometry, Resenhas IME-USP 2 (1995), 165-186.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.