TheoremDB

Problem packetResearch packetR1196

R1196Sourced 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 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$?

The record cites sources for its explanation.

Recorded status: reported

Recorded scope: No scope is recorded.

Originating problem: Maximal Number of Distinct Prime Factors in Pairwise Sums Products

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 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$?

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": "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": [],
  "continuation": null,
  "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"
    }
  ]
}

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.