Erdős Problem #948 — Finite-sums sets avoiding colours
Is there a function and a such that in any -colouring of the integers there exists a sequence such that for infinitely many and the set does not contain all colours?
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
A claimed computer-generated construction would disprove the problem, but no independent proof has yet confirmed it.
Erdős and Galvin asked whether one can choose a function and a finite number of colours forcing a slowly growing sequence whose finite subset sums omit a colour.
Known results
- Galvin ruled out the monochromatic version for using a two-colouring based on powers of .
- Erdős and Galvin showed that, for every , sequences with can have finite interval sums using only two colours.
- The corresponding question for countably many colours was recorded as open.
Claimed negative answer (date not stated)
GPT Pro, prompted by Price, claimed that for every there is a colouring of by such that every sequence satisfying for infinitely many has finite subset sums of every colour. A discussion gives a rough binary-digit interval construction, but no formal verification or independent publication was found.
Current status (as of April 2026): The GPT Pro construction is claimed to settle the problem negatively, while the proposed proof remains unverified and the problem is not resolved in the published record.
Sources
Solutions 0
No solutions have been posted yet.