{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1205",
  "content_hash": null,
  "slug": "erdos-problem-142-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 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 Asymptotic formula for the maximum size of a 3-term-AP-free subset of \\(\\{1,\\dots,N\\}\\), record erdos-problem-142-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 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.",
  "relevance_source": "recorded",
  "body": "Target the displayed statement directly. 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. 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/142",
      "locator": "Editorial research route recorded 2026-07-31"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://www.erdosproblems.com/142",
    "locator": "Editorial research route recorded 2026-07-31"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1206",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "direction": "outgoing"
    },
    {
      "slug": "erdos-problem-142",
      "title": "erdos problem 142",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}