Problem packetWorkR1224
[#R1224] Current status and unresolved remainder
claim. OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 28 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 28: Let $A$ be a set of natural numbers. For each $n \in \mathbb{N}$, define the representation function $r_A(n)$ to be the number of ordered pairs $(a, b) \in A \times A$ such that $a + b = n$. Suppose that the complement of the sumset $A + A = \{a + b : a, b \in A\}$ is finite, meaning that all but finitely many natural numbers can be expressed as a sum of two elements of $A$. Prove that $\limsup_{n \to \infty} r_A(n) = \infty$.
1Summary
OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 28 as open. The unresolved remainder is the full displayed statement.
A complete resolution must satisfy this condition: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 28: Let $A$ be a set of natural numbers. For each $n \in \mathbb{N}$, define the representation function $r_A(n)$ to be the number of ordered pairs $(a, b) \in A \times A$ such that $a + b = n$. Suppose that the complement of the sumset $A + A = \{a + b : a, b \in A\}$ is finite, meaning that all but finitely many natural numbers can be expressed as a sum of two elements of $A$. Prove that $\limsup_{n \to \infty} r_A(n) = \infty$.
Supported evidence. Replay readiness: source only.
2Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: www.erdosproblems.com ↗, See dataset.references[0] for the exact external source and locator.
3How it connects
Addressed by
- attempt
Recorded for
- problem
4Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1224",
"content_hash": null,
"slug": "erdos-problem-28-claim-status-20260731",
"type": "claim",
"title": "Current status and unresolved remainder",
"summary": "OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 28 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 28: Let $A$ be a set of natural numbers. For each $n \\in \\mathbb{N}$, define the representation function $r_A(n)$ to be the number of ordered pairs $(a, b) \\in A \\times A$ such that $a + b = n$. Suppose that the complement of the sumset $A + A = \\{a + b : a, b \\in A\\}$ is finite, meaning that all but finitely many natural numbers can be expressed as a sum of two elements of $A$. Prove that $\\limsup_{n \\to \\infty} r_A(n) = \\infty$.",
"relevance": "For erdos problem 28, pins the dated research frontier: OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 28 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 28: Let.",
"relevance_source": "recorded",
"body": "OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 28 as open. The unresolved remainder is the full displayed statement.\n\nA complete resolution must satisfy this condition: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 28: Let $A$ be a set of natural numbers. For each $n \\in \\mathbb{N}$, define the representation function $r_A(n)$ to be the number of ordered pairs $(a, b) \\in A \\times A$ such that $a + b = n$. Suppose that the complement of the sumset $A + A = \\{a + b : a, b \\in A\\}$ is finite, meaning that all but finitely many natural numbers can be expressed as a sum of two elements of $A$. Prove that $\\limsup_{n \\to \\infty} r_A(n) = \\infty$.",
"status": "reported",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://www.erdosproblems.com/28",
"locator": "See dataset.references[0] for the exact external source and locator."
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://www.erdosproblems.com/28",
"locator": "See dataset.references[0] for the exact external source and locator."
},
"models": [],
"relations": [
{
"slug": "R1223",
"title": "Resolve the stated acceptance condition",
"object_type": "attempt",
"relation": "addresses",
"direction": "incoming"
},
{
"slug": "erdos-problem-28",
"title": "erdos problem 28",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}5Provenance
View source, identifiers, and projection details
- Project
- erdos-problem-28-source-review
- Locator
- See dataset.references[0] for the exact external source and locator.
- License
- CC0-1.0
- Contributors
- TheoremDB maintainers
- Source
- www.erdosproblems.com ↗
- Public record
- R1224
- Stable alias
- erdos-problem-28-claim-status-20260731
- Projection
- Reproduction fields are derived from the immutable record.
A statement this project treats as settled at the recorded evidence grade, with the work that backs it.