Erdős Problem #432
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Suppose \(A\) and \(B\) are two infinite sets of positive integers. Form their complete sumset
Erdős Problem 432, originally asked by Ernst Straus, asks how dense this sumset can be if every two different numbers in \(A+B\) are relatively prime. Two integers are relatively prime when their greatest common divisor is \(1\). The requirement concerns every distinct pair of values in the whole sumset, not merely the consecutive values or the specific pairs used to create the sums.
A subtle feature is that the same number may have more than one representation as \(a+b\). The sumset is a set: equal sums are counted once. Repeated representations do not by themselves violate pairwise relative primality. The structure of sums from two infinite sets is what makes this question difficult, not merely finding a list of mutually coprime integers.
The problem was inspired by Ostmann's inverse Goldbach problem, Erdős #431, but it is different. Here values need not be prime: each must merely be coprime to every other distinct value.
A small example
Choose finite sets \(A=\{1,3\}\) and \(B=\{2,4\}\). Their four pair sums are
Hence \(A+B=\{3,5,7\}\). The distinct sums are pairwise coprime: \(\gcd(3,5)=\gcd(3,7)=\gcd(5,7)=1\). The value \(5\) appears twice, but this is allowed because we count distinct sumset values rather than their representations.
This example is finite and therefore says nothing about the existence or density of a sumset generated by two infinite sets. It is useful for fixing the definition and catching an implementation error: an algorithm that rejects repeated representations as collisions would wrongly reject these sets.
There is also a universal elementary bound. Let \(C\) be any set of pairwise coprime positive integers. For each member \(c\geq2\), choose its smallest prime factor \(p(c)\). Different members of \(C\) cannot have the same chosen prime factor, or they would have a common divisor greater than one. Therefore the map \(c\mapsto p(c)\) is injective on \(C\cap[2,x]\) and its values are primes not exceeding \(x\). Consequently
where \(\pi(x)\) counts primes up to \(x\) and the extra \(1\) allows the number \(1\) itself. Since \(\pi(x)=o(x)\), every pairwise-coprime set has natural density zero. The meaningful issue in Straus's question is consequently how large a sumset can be on a prime-scale, or under finer growth comparisons, not whether it has a positive fraction of all integers.
What is known
The original question appears in P. Erdős and R. L. Graham, Old and New Problems and Results in Combinatorial Number Theory (1980), printed p. 85 of the historical scan. The authors attribute it to Ernst Straus and mention its connection with Ostmann's question about prime sumsets.
The maintained Erdős Problems #432 page marks the problem OPEN. It has no generally accepted resolution of the strongest density question. The elementary \(\pi(x)+1\) upper bound above applies to every pairwise-coprime set; it does not exploit the extra condition \(C=A+B\) with both summand sets infinite. Sharper information should come from that additional additive structure.
There is also recent research that must be treated as preliminary evidence rather than established full resolution. A June 23, 2026 public comment by Sungchul Lee links a research manuscript repository. It describes several partial results about constructions and sieving, with connections to a 2026 Banks–Ford paper on sets satisfying Bateman–Horn statistics. Those claims require theorem-by-theorem verification, exact version and hypothesis checks, and independent mathematical review before becoming authoritative findings. The maintained page continues to classify the overall problem as open.
A counting argument on its own is insufficient: infinitely many primes form a pairwise-coprime set of size \(\pi(x)\) up to \(x\), but one has not thereby represented them as the full sumset of two infinite sets. In fact that is the source of the related Ostmann problem. The additional sumset factorization is the essential obstruction.
GCL's current state
The original source issue #1702 pins teorth/erdosproblems at commit 536408716724a2402bdfa7c1d764bf83d64a8c89, file data/problems.yaml with Git blob 4e60263a80af6207aca494d2e1388e44fa372889. The frozen status is open, consistent with the maintained page's classification.
The issue records no Problem 432 statement file in GCL's admitted FormalConjectures revision 85f863718beeec7b58a3a1926ee92e3472bc2020. The absence of a pinned file is a statement-provenance fact, not proof that a new formalization would be impossible. No Lean build, axiom audit or mathematical certification is claimed.
The authenticated source report is original issue #1702, RESULT/1 comment #6157488945. It documents the open question, a verified elementary bound and the existence of the preliminary 2026 manuscript. It does not decide protected editorial acceptance; that is the role of the Compendium's V2 ledger.
What remains
A bounded next step is to enumerate finite sets \(A,B\subseteq[1,20]\) of at least two members each, calculate their distinct sumset values and test \(\gcd(c,d)=1\) for every pair of distinct values. Two separate implementations can compare the maximum attained sumset size and record representative examples. The computation must use distinct sumset elements; it must not regard two representations of the same integer as a coprimality failure.
Separately, examine the exact statements and proofs of the claimed results in Lee's 2026 manuscript. Record the source version, sieve inputs, whether any assumptions are conditional, and the definition of density used. Distinguish the proved elementary bound on any pairwise-coprime set from any stronger bounds applying to genuine infinite sumsets. Acceptance is independent finite agreement and a source-backed mathematical-claim table. Falsification includes a wrong gcd, an incorrect count of distinct sums, or an unjustified promotion of a preliminary manuscript to a complete theorem. Stop at the finite fixture and documentary audit, preserving the main density problem as open.
Sources and claim boundaries
Primary historical source: Erdős–Graham (1980), p. 85. Maintained mathematical status: Problem #432. Preliminary 2026 research: Sungchul Lee's public manuscript repository. Original GCL provenance: issue #1702, frozen catalogue, and authenticated source audit.
The finite example and injective smallest-prime-factor bound are independently verifiable. The new manuscript is an unadjudicated external source. No original infinite construction, certified density theorem, formal proof or protected editorial admission is asserted.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1702 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.