Erdős Problem #471 — Generating unbounded prime sets by three-prime sums
Statement
Starting from a finite set of primes , define by adjoining to every prime that is a sum of three distinct elements of . Is there a choice of for which the sizes of the sets are unbounded? In particular, does the initial set consisting of work?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.