TheoremDB

Problem packetResearch packetR1252

R1252Sourced evidence

Current status and unresolved remainder

View evidenceOpen source ↗
Link to a section

Authored summary

OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 66 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 66: Let $\mathbb{N}$ denote the set of positive integers. For a subset $A \subseteq \mathbb{N}$ and a positive integer $n$, define the additive representation function $r_A(n)$ to be the number of ordered pairs $(a, b) \in A \times A$ such that $a + b = n$. Does there exist a subset $A \subseteq \mathbb{N}$ and a nonzero real number $c$ such that the limit \[\lim_{n \to \infty} \frac{r_A(n)}{\log n} = c\] exists?

The record cites sources for its explanation.

Recorded status: reported

Recorded scope: No scope is recorded.

Originating problem: Erdős's Additive Representation Density Problem

Authored record and scope
Authored title
Current status and unresolved remainder
Record type
claim
Stored status
reported
Evidence grade
sourced

2Authored explanation

OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 66 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 66: Let $\mathbb{N}$ denote the set of positive integers. For a subset $A \subseteq \mathbb{N}$ and a positive integer $n$, define the additive representation function $r_A(n)$ to be the number of ordered pairs $(a, b) \in A \times A$ such that $a + b = n$. Does there exist a subset $A \subseteq \mathbb{N}$ and a nonzero real number $c$ such that the limit \[\lim_{n \to \infty} \frac{r_A(n)}{\log n} = c\] exists?

Continue this work
Replay material: source only

3Evidence

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.

4How it connects

Addressed by

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1252",
  "content_hash": null,
  "slug": "erdos-problem-66-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 66 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 66: Let $\\mathbb{N}$ denote the set of positive integers. For a subset $A \\subseteq \\mathbb{N}$ and a positive integer $n$, define the additive representation function $r_A(n)$ to be the number of ordered pairs $(a, b) \\in A \\times A$ such that $a + b = n$. Does there exist a subset $A \\subseteq \\mathbb{N}$ and a nonzero real number $c$ such that the limit\n\\[\\lim_{n \\to \\infty} \\frac{r_A(n)}{\\log n} = c\\]\nexists?",
  "relevance": "For erdos problem 66, pins the dated research frontier: OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 66 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 66: Let.",
  "relevance_source": "recorded",
  "body": "OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 66 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 66: Let $\\mathbb{N}$ denote the set of positive integers. For a subset $A \\subseteq \\mathbb{N}$ and a positive integer $n$, define the additive representation function $r_A(n)$ to be the number of ordered pairs $(a, b) \\in A \\times A$ such that $a + b = n$. Does there exist a subset $A \\subseteq \\mathbb{N}$ and a nonzero real number $c$ such that the limit\n\\[\\lim_{n \\to \\infty} \\frac{r_A(n)}{\\log n} = c\\]\nexists?",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://www.erdosproblems.com/66",
      "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/66",
    "locator": "See dataset.references[0] for the exact external source and locator."
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R1251",
      "title": "Resolve the stated acceptance condition",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "erdos-problem-66",
      "title": "erdos problem 66",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.