← All problems

Erdős Problem #17 — Primes below which every even number is a difference of primes

31 years old · traced to

A purely computational problem (this problem cannot be attacked by other means at present). Call a prime pp good if every even number 2r≤p−32r \leq p - 3 can be written in the form q1−q2q_1 - q_2 where q1≤pq_1 \leq p, q2≤pq_2 \leq p 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.

Source: 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.