TheoremDB

Problem packetWorkR1206

R1206claimStatus: reportedEvidence: SupportedReplay: source only

[#R1206] Current status and unresolved remainder

claim. OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 142 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 142: For a positive integer \(N\), let \(r_3(N)\) denote the largest possible cardinality of a subset of \(\{1, 2, \dots, N\}\) that contains no non-trivial 3-term arithmetic progression. A 3-term arithmetic progression is called non-trivial if its terms are distinct. Determine whether there exists a function \(f: \mathbb{N} \to \mathbb{R}\) such that \(r_3(N) = \Theta(f(N))\) as \(N \to \infty\), and if so, identify such a function. That is, find an explicit asymptotic formula for \(r_3(N)\) up to constant factors.

View evidenceOpen source ↗

1Summary

OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 142 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 142: For a positive integer \(N\), let \(r_3(N)\) denote the largest possible cardinality of a subset of \(\{1, 2, \dots, N\}\) that contains no non-trivial 3-term arithmetic progression. A 3-term arithmetic progression is called non-trivial if its terms are distinct. Determine whether there exists a function \(f: \mathbb{N} \to \mathbb{R}\) such that \(r_3(N) = \Theta(f(N))\) as \(N \to \infty\), and if so, identify such a function. That is, find an explicit asymptotic formula for \(r_3(N)\) up to constant factors.

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": "R1206",
  "content_hash": null,
  "slug": "erdos-problem-142-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 142 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 142: For a positive integer \\(N\\), let \\(r_3(N)\\) denote the largest possible cardinality of a subset of \\(\\{1, 2, \\dots, N\\}\\) that contains no non-trivial 3-term arithmetic progression. A 3-term arithmetic progression is called non-trivial if its terms are distinct. Determine whether there exists a function \\(f: \\mathbb{N} \\to \\mathbb{R}\\) such that \\(r_3(N) = \\Theta(f(N))\\) as \\(N \\to \\infty\\), and if so, identify such a function. That is, find an explicit asymptotic formula for \\(r_3(N)\\) up to constant factors.",
  "relevance": "For erdos problem 142, pins the dated research frontier: OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 142 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 142.",
  "relevance_source": "recorded",
  "body": "OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 142 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 142: For a positive integer \\(N\\), let \\(r_3(N)\\) denote the largest possible cardinality of a subset of \\(\\{1, 2, \\dots, N\\}\\) that contains no non-trivial 3-term arithmetic progression. A 3-term arithmetic progression is called non-trivial if its terms are distinct. Determine whether there exists a function \\(f: \\mathbb{N} \\to \\mathbb{R}\\) such that \\(r_3(N) = \\Theta(f(N))\\) as \\(N \\to \\infty\\), and if so, identify such a function. That is, find an explicit asymptotic formula for \\(r_3(N)\\) up to constant factors.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://www.erdosproblems.com/142",
      "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/142",
    "locator": "See dataset.references[0] for the exact external source and locator."
  },
  "models": [],
  "relations": [
    {
      "slug": "R1205",
      "title": "Resolve the stated acceptance condition",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "erdos-problem-142",
      "title": "erdos problem 142",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

5Provenance

View source, identifiers, and projection details
Project
erdos-problem-142-source-review
Locator
See dataset.references[0] for the exact external source and locator.
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1206
Stable alias
erdos-problem-142-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.