Erdős Problem #843
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: number theory.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Ramsey completeness means that any finite coloring of the infinite set leaves one color class whose distinct-element subset sums represent all sufficiently large integers. The theorem for powers is substantially stronger than finding just one large monochromatic sum.
A set of positive integers S is Ramsey r-complete if EVERY coloring S with r colors has at least one color class whose subset sums of DISTINCT elements contain all sufficiently large positive integers. Ask for S consisting of square numbers, and separately kth powers with r,k>=2. This is about all sufficiently large targets, not merely arbitrarily large representable targets.
A small example
For squares {1,4,9}, the distinct-element subset sums are {0,1,4,5,9,10,13,14}. Target 2 is missing; this is expected because Ramsey completeness is an eventually-all-integers statement on an INFINITE colored sequence. Any finite initial segment must miss sufficiently large integers.
A finite instance tests the definition, not a claim quantified over every large graph, infinite set or arbitrary coloring.
What is known
Maintained https://www.erdosproblems.com/latex/843 read 2026-10-14: Burr's result for powers mentioned by Erdős in 1995 was unpublished. Conlon–Fox–Pham [CFP21], Subset sums, completeness and colorings, arXiv:2104.14766 (2021) proved a STRONGER theorem including sparse Ramsey r-complete subsequences of kth powers for all r,k>=2. Full original proof and sparseness conditions not independently verified; do not treat unpublished Burr note as primary proof.
Let FS(C) denote all sums of finite subsets of C, with each summand used at most once. Ramsey r-completeness asks that for every coloring there exist a color class C and an integer N0 such that EVERY integer at least N0 belongs to FS(C). It does not ask for every color class to be complete, nor for a finite initial prefix to represent every number. Conlon, Fox and Pham report a stronger sparse-subsequence theorem.
GCL's current state
The authenticated original RESULT/1 source return records SOURCE_LOCK_READY and preserves its issue-bound mathematical source observations. This explanatory article is REVIEWED under the exact-hash EC-BULK-005-R6 editorial transaction, subject to the protected merge of PR #2676. Its original source-audit status is retained. Editorial acceptance and public MathJax validation do not certify any original research theorem, external Lean file, or complete historical proof.
Unclosed mathematical proof/source qualifications: CONLON_FOX_PHAM2021_FULL_PROOF_NOT_REPLAYED; SPARSENESS_DETAILS_PENDING.
What remains
Implement subset-sum enumerator and finite coloring demonstration; source-read full 2021 theorem with definition of 'sparse' and quantifiers, distinguish square-vs-higher-power and r-color statement.
For mathematical proof certification, the complete primary argument and any external formalization must undergo separate independent replay. The bounded finite calculation is recorded in the governed R6 fixture; editorial approval does not discharge the outstanding research obligations.
Sources and claim boundaries
- Erdős problem #843 and maintained LaTeX/bibliography, read 14 October 2026.
- Authenticated source-audit return, including original historical bibliography and source proof limitations.
- Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml. External proofs not independently GCL certified.
- Editorial decision: exact-hash reviewed explanatory article, protected R6 transaction. Mathematical theorem proof / external Lean certification: NOT CLAIMED. The original SOURCE_LOCK_READY return, primary-source attribution, and proof-review holds remain.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2114 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.