TheoremDB

Problem packetWorkR1196

R1196claimStatus: reportedEvidence: SupportedReplay: source only

[#R1196] Current status and unresolved remainder

claim. OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 126 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 126: For each positive integer $n$, let $f(n)$ denote the maximum integer $m$ such that for every subset $A \subseteq \mathbb{N}$ with $|A| = n$, the product $\prod_{\substack{a,b \in A \\ a \neq b}} (a + b)$ has at least $m$ distinct prime factors. Is it true that $\displaystyle\frac{f(n)}{\log n} \to \infty$ as $n \to \infty$?

View evidenceOpen source ↗

1Summary

OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 126 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 126: For each positive integer $n$, let $f(n)$ denote the maximum integer $m$ such that for every subset $A \subseteq \mathbb{N}$ with $|A| = n$, the product $\prod_{\substack{a,b \in A \\ a \neq b}} (a + b)$ has at least $m$ distinct prime factors. Is it true that $\displaystyle\frac{f(n)}{\log n} \to \infty$ as $n \to \infty$?

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": "R1196",
  "content_hash": null,
  "slug": "erdos-problem-126-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 126 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 126: For each positive integer $n$, let $f(n)$ denote the maximum integer $m$ such that for every subset $A \\subseteq \\mathbb{N}$ with $|A| = n$, the product $\\prod_{\\substack{a,b \\in A \\\\ a \\neq b}} (a + b)$ has at least $m$ distinct prime factors. Is it true that $\\displaystyle\\frac{f(n)}{\\log n} \\to \\infty$ as $n \\to \\infty$?",
  "relevance": "For erdos problem 126, pins the dated research frontier: OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 126 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 126.",
  "relevance_source": "recorded",
  "body": "OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 126 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 126: For each positive integer $n$, let $f(n)$ denote the maximum integer $m$ such that for every subset $A \\subseteq \\mathbb{N}$ with $|A| = n$, the product $\\prod_{\\substack{a,b \\in A \\\\ a \\neq b}} (a + b)$ has at least $m$ distinct prime factors. Is it true that $\\displaystyle\\frac{f(n)}{\\log n} \\to \\infty$ as $n \\to \\infty$?",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://www.erdosproblems.com/126",
      "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/126",
    "locator": "See dataset.references[0] for the exact external source and locator."
  },
  "models": [],
  "relations": [
    {
      "slug": "R1195",
      "title": "Resolve the stated acceptance condition",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "erdos-problem-126",
      "title": "erdos problem 126",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

5Provenance

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