Open-access mathematical research insights
About Contact
Home / Erdos Problems / Problem #471

Problem #471: Given a finite set of primes $Q=Q_0$, define a sequence of...

Given a finite set of primes $Q=Q_0$, define a sequence of sets $Q_i$ by letting $Q_{i+1}$ be $Q_i$ together with all primes formed by adding three...

Problem Statement

Given a finite set of primes $Q=Q_0$, define a sequence of sets $Q_i$ by letting $Q_{i+1}$ be $Q_i$ together with all primes formed by adding three distinct elements of $Q_i$. Is there some initial choice of $Q$ such that the $Q_i$ become arbitrarily large?
Categories: Number Theory

Progress

A problem of Ulam. In particular, what about $Q=\{3,5,7,11\}$?

Mrazović and Kovač, and independently Alon, have observed that the existence of some valid choice of $Q$ follows easily from Vinogradov's theorem that every large odd integer is the sum of three distinct primes. In particular, there exists some $N$ such that every prime $>N$ is the sum of three distinct (smaller) primes. We may then take $Q_0$ to be the set of all primes $\leq N$ (in which case all primes are eventually in some $Q_i$).

Source: erdosproblems.com/471 | Last verified: January 15, 2026

Stay Updated

Get weekly digests of new research insights delivered to your inbox.