Problem packetWorkR1227
[#R1227] Resolve the stated acceptance condition
1Summary
Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 30: Let $h(N)$ denote the maximum cardinality of a Sidon set contained in $\{1, 2, \dots, N\}$. A set $A \subseteq \mathbb{N}$ is called a Sidon set if all pairwise sums $a + b$ with $a \leq b$ and $a, b \in A$ are distinct. Determine whether, for every $\varepsilon > 0$, the asymptotic bound \[h(N) - \sqrt{N} = O\bigl(N^{\varepsilon}\bigr)\] holds as $N \to \infty$. Equivalently, determine whether $h(N) = \sqrt{N} + O_{\varepsilon}(N^{\varepsilon})$ for all $\varepsilon > 0$.
Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 30: Let $h(N)$ denote the maximum cardinality of a Sidon set contained in $\{1, 2, \dots, N\}$. A set $A \subseteq \mathbb{N}$ is called a Sidon set if all pairwise sums $a + b$ with $a \leq b$ and $a, b \in A$ are distinct. Determine whether, for every $\varepsilon > 0$, the asymptotic bound \[h(N) - \sqrt{N} = O\bigl(N^{\varepsilon}\bigr)\] holds as $N \to \infty$. Equivalently, determine whether $h(N) = \sqrt{N} + O_{\varepsilon}(N^{\varepsilon})$ for all $\varepsilon > 0$. Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.
Reported evidence. Replay readiness: source only.
2Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: www.erdosproblems.com ↗, Editorial research route recorded 2026-07-31
3How it connects
Addresses
- claim
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": "R1227",
"content_hash": null,
"slug": "erdos-problem-30-attempt-resolution-route",
"type": "attempt",
"title": "Resolve the stated acceptance condition",
"summary": "Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 30: Let $h(N)$ denote the maximum cardinality of a Sidon set contained in $\\{1, 2, \\dots, N\\}$. A set $A \\subseteq \\mathbb{N}$ is called a Sidon set if all pairwise sums $a + b$ with $a \\leq b$ and $a, b \\in A$ are distinct. Determine whether, for every $\\varepsilon > 0$, the asymptotic bound\n\\[h(N) - \\sqrt{N} = O\\bigl(N^{\\varepsilon}\\bigr)\\]\nholds as $N \\to \\infty$. Equivalently, determine whether $h(N) = \\sqrt{N} + O_{\\varepsilon}(N^{\\varepsilon})$ for all $\\varepsilon > 0$.",
"relevance": "For Erdős Problem 30 on Sidon Sets, record erdos-problem-30-attempt-resolution-route (“Resolve the stated acceptance condition”) documents a concrete method, search boundary, or failed route. The record states: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 30: Let $h(N)$ denote the maximum cardinality of a Sidon set contained in $\\{1, 2, \\dots, N\\}$.",
"relevance_source": "recorded",
"body": "Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 30: Let $h(N)$ denote the maximum cardinality of a Sidon set contained in $\\{1, 2, \\dots, N\\}$. A set $A \\subseteq \\mathbb{N}$ is called a Sidon set if all pairwise sums $a + b$ with $a \\leq b$ and $a, b \\in A$ are distinct. Determine whether, for every $\\varepsilon > 0$, the asymptotic bound\n\\[h(N) - \\sqrt{N} = O\\bigl(N^{\\varepsilon}\\bigr)\\]\nholds as $N \\to \\infty$. Equivalently, determine whether $h(N) = \\sqrt{N} + O_{\\varepsilon}(N^{\\varepsilon})$ for all $\\varepsilon > 0$. Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.",
"status": "open_strategy",
"evidence_grade": "self_reported",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"url": "https://www.erdosproblems.com/30",
"locator": "Editorial research route recorded 2026-07-31"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://www.erdosproblems.com/30",
"locator": "Editorial research route recorded 2026-07-31"
},
"models": [],
"relations": [
{
"slug": "R1228",
"title": "Current status and unresolved remainder",
"object_type": "claim",
"relation": "addresses",
"direction": "outgoing"
},
{
"slug": "erdos-problem-30",
"title": "erdos problem 30",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}5Provenance
View source, identifiers, and projection details
- Project
- erdos-problem-30-source-review
- Locator
- Editorial research route recorded 2026-07-31
- License
- CC0-1.0
- Contributors
- TheoremDB maintainers
- Source
- www.erdosproblems.com ↗
- Public record
- R1227
- Stable alias
- erdos-problem-30-attempt-resolution-route
- Projection
- Reproduction fields are derived from the immutable record.
A route someone took, recorded so the next person can reuse it or avoid it.