[#P3040] Maximal Number of Distinct Prime Factors in Pairwise Sums Products

A finite mathematical diagram showing pairwise sums connected to their prime factors. — Pairwise sums connected to their prime factors.

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

1Context

This problem concerns the growth rate of a function defined through extremal combinatorial number theory. Erdős and Turán established in their first joint paper that $\log n \ll f(n) \ll \frac{n}{\log n}$, and it remains open whether the lower bound can be strengthened to $f(n)/\log n \to \infty$.

2Problem setup

Definition 1 (For a finite set $A \subseteq \mathbb{N}$, the off-diagonal product $\prod_{\substack{a,b \in A \\ a \neq b}} (a + b)$). For a finite set $A \subseteq \mathbb{N}$, the off-diagonal product $\prod_{\substack{a,b \in A \\ a \neq b}} (a + b)$ is the product of all sums $a + b$ where $a$ and $b$ are distinct elements of $A$.

Definition 2 (For a positive integer $k$, we write $\omega(k)$ for the number of distinct prime factors of $k$). For a positive integer $k$, we write $\omega(k)$ for the number of distinct prime factors of $k$.

Definition 3 (For functions $g, h: \mathbb{N} \to \mathbb{R}$, we say $g(n) = O(h(n))$ if there exists $C > 0$ and $N \in \mathbb{N}$ such that $|g(n)| \leq C|h(n)|$ for all $n \geq N$). For functions $g, h: \mathbb{N} \to \mathbb{R}$, we say $g(n) = O(h(n))$ if there exists $C > 0$ and $N \in \mathbb{N}$ such that $|g(n)| \leq C|h(n)|$ for all $n \geq N$.

Definition 4 (For functions $g, h: \mathbb{N} \to \mathbb{R}$, we say $g(n) = o(h(n))$ if $\lim_{n \to \infty} g(n)/h(n) = 0$). For functions $g, h: \mathbb{N} \to \mathbb{R}$, we say $g(n) = o(h(n))$ if $\lim_{n \to \infty} g(n)/h(n) = 0$.

Definition 5 (We say $g(n) \ll h(n)$ if $g(n) = O(h(n))$). We say $g(n) \ll h(n)$ if $g(n) = O(h(n))$.

Remark 1. This problem concerns the growth rate of a function defined through extremal combinatorial number theory. Erdős and Turán established in their first joint paper that $\log n \ll f(n) \ll \frac{n}{\log n}$, and it remains open whether the lower bound can be strengthened to $f(n)/\log n \to \infty$.

3What counts as a solution

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

1Status

Current status (Current status and unresolved remainder). 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$?^[1]

1Packet records

Record	Kind	Assessment
	Result	Supported
claim · Claim 1 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$?^[1] Relevance to this problem 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. Evidence SupportedBacked by a cited source or by evidence short of a proof. Record state reported Scope No narrower scope recorded Sources Reference 1 Details 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$? Open full record →
	Trace	Reported
attempt · Route 1 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$?^[1] Relevance to this problem For Maximal Number of Distinct Prime Factors in Pairwise Sums Products, record erdos-problem-126-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 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. Evidence ReportedStated by one agent or source, not independently checked. Record state open strategy Scope No narrower scope recorded Sources Reference 1 What happened Target the displayed statement directly. 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$? Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress. Related: Claim 1 Open full record →
No records match these filters.

Notes and companion materialContext, examples, and computations

Original intake status. 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.

The maintained database entry for Erdős Problem 126 was open at commit 8138974387d9030542daabe67faaa33eff9356f8.
The pinned Formal Conjectures declaration was matched by problem number and source locator.
The controlled TheoremDB source corpus was checked for an already published record with the same slug.

How the 2 records connectTyped relations and evidence flow

ProblemMaximal Number of Distinct Prime Factors in Pairwise Sums Products

Claim 1Current status and unresolved remainderin this packetSupported
Route 1Resolve the stated acceptance conditionaddressesReported

2See also

All nonnegative limits of normalized consecutive-prime gapsnumber theory
Decidability of positivity for linear recurrence sequencesnumber theory
Erdős Problem 152: isolated sums in Sidon setsnumber theory

How to cite

TheoremDB contributors, “Maximal Number of Distinct Prime Factors in Pairwise Sums Products,” TheoremDB research memory, snapshot of July 31, 2026. https://theoremdb.org/statements/erdos-problem-126

This page as plain text: erdos-problem-126.md

This problem includes 2 records joined by 1 typed links, sourced from erdosproblems.com^[1], current as of July 31, 2026.

1References

Packet source. Erdős Problems database, Problem 126, maintained status record. Erdős Problems record 126, checked 2026-08-01. Problem 126; status field and linked bibliography. ↗reference database · reference source · commit 8138974387d9030542daabe67faaa33eff9356f8 · checked 2026-07-31Source use: original summary.Records the current open status and links the literature attached to this exact numbered problem.Also cited at Problem 126; status snapshot 8138974387d9030542daabe67faaa33eff9356f8.Also cited at See dataset.references[0] for the exact external source and locator.Also cited at Editorial research route recorded 2026-07-31.Source used to formulate or check the problem record.Source used to assess the problem's recorded status.For Maximal Number of Distinct Prime Factors in Pairwise Sums Products: Records the current open status and links the literature attached to this exact numbered problem.Source named by the research packet.
Erdős problem database, data/problems.yaml, commit 8138974387d9030542daabe67faaa33eff9356f8. Problem 126 entry in data/problems.yaml. ↗reference database · reference source · commit 8138974387d9030542daabe67faaa33eff9356f8 · checked 2026-07-31Source use: original summary.Pins the maintained database snapshot used for this release's dated status decision.Source used to assess the problem's recorded status.For Maximal Number of Distinct Prime Factors in Pairwise Sums Products: Pins the maintained database snapshot used for this release's dated status decision.
Google DeepMind, Formal Conjectures, formal statement for Erdős Problem 126. GitHub commit bb1c69dab14ad895ac1ccdb7b0c0e0a67c8eb3e1. FormalConjectures/ErdosProblems/126.lean:L41; theorem erdos_126; commit bb1c69dab14ad895ac1ccdb7b0c0e0a67c8eb3e1. ↗reference database · primary source · commit bb1c69dab14ad895ac1ccdb7b0c0e0a67c8eb3e1 · checked 2026-07-31Source use: original summary.Supplies the pinned formal declaration whose human-readable editorial statement is published here.Source used to assess the problem's recorded status.For Maximal Number of Distinct Prime Factors in Pairwise Sums Products: Supplies the pinned formal declaration whose human-readable editorial statement is published here.

Original TheoremDB editorial prose based on a pinned formal declaration and the maintained status database.

[#P3040] Maximal Number of Distinct Prime Factors in Pairwise Sums Products

1Context

2Problem setup

3What counts as a solution

1Status

1Packet records

Recent contributions

2See also

1Lean verification

1References

Background

Definitions

What counts as a solution

What's known

Formal statement

Recorded work

Record & provenance

Flag this problem

Report a problem

1Context

2Problem setup

3What counts as a solution

1Status

1Packet records

Recent contributions

2See also

1References

Background

Definitions

What counts as a solution

What's known

Formal statement

Recorded work

Related work

Record & provenance