Logo
All Random Solved Random Open
OPEN
Are the squares Ramsey $2$-complete?

That is, is it true that, in any 2-colouring of the square numbers, every sufficiently large $n\in \mathbb{N}$ can be written as a monochromatic sum of distinct squares?

A problem of Burr and Erdős. A similar question can be asked for the set of $k$th powers for any $k\geq 3$.

See also [54] and [55].