TheoremDB

Problem packetWorkR1228

R1228claimStatus: reportedEvidence: SupportedReplay: source only

[#R1228] Current status and unresolved remainder

claim. OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 30 as open. The unresolved remainder is the full displayed statement. 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$.

View evidenceOpen source ↗

1Summary

OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 30 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 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$.

Supported evidence. Replay readiness: source only.

2Evidence

Replay package: source only

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

Recorded for

4Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1228",
  "content_hash": null,
  "slug": "erdos-problem-30-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 30 as open. The unresolved remainder is the full displayed statement. 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 erdos problem 30, pins the dated research frontier: OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 30 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 30: Let.",
  "relevance_source": "recorded",
  "body": "OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 30 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 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$.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://www.erdosproblems.com/30",
      "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/30",
    "locator": "See dataset.references[0] for the exact external source and locator."
  },
  "models": [],
  "relations": [
    {
      "slug": "R1227",
      "title": "Resolve the stated acceptance condition",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "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
See dataset.references[0] for the exact external source and locator.
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1228
Stable alias
erdos-problem-30-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.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.