Erdős·erdos:1
Erdős Problem 1
No independent check recorded yet. A formal artifact, declaration or published object is attached, but no rebuild of it is recorded here.
Fidelity F2: The correspondence is declared through an alignment table and written divergences.
number theory, additive combinatorics·Source
AI activity
How grades workDisproved: for any ε > 0 there are arbitrarily large n for which such a set fits in {1, …, N} with N ≤ ε·2^n.
Reasoning and sources
Autonomy
The page credits GPT-6 Astra and does not say how it was directed.
Details
attribution: This was disproved by GPT-6 Astra (see the proof expositions), which proved that, for any $\epsilon>0$, there are arbitrarily large $n$ such that\[N\leq \epsilon 2^n.\]The trivial lower bound is $N \gg 2^{n}/n$, since all $2^n$ distinct subset sums must lie in $[0,Nn)$. If $F(x)$ is the size of such a set then this problem is equivalent to\[F(x) <\log_2x+O(1).\]The GPT construction above proves that in fact, for any constant $C>0$, for infinitely many $x$,\[F(x)>\log_2x+C\]for some absolute constant $c>0$.
Claimed on erdosproblems.com
2Proof claims posted on erdosproblems.com, which says that listing a claim “is no guarantee of proof correctness”. The register records who claims what, with which systems, and links to each claim there. Nobody has examined them, and none counts in the register's totals.
Fidelity
How fidelity is gradedF2 declared. The correspondence is declared through an alignment table and written divergences.
Declared by the projects
1As each project's formalization.yaml states it.
Erdős problem #1: disproof
- method
- autonomous — GPT-6 Astra (pre-release version, OpenAI)
- review
- other — mechanically verified (comparator: lean kernel replay, standard axioms only) in the benchmark harness and again in this repository's ci; preliminary informal reading of the argument by thomas f. bloom; no independent refereeing (Thomas F. Bloom)
- sorry
- 0 unproved goals declared
- sources
- Disproof of Erdős problem #1: A sum-distinct set A ⊆ {1,…,N} of size n does not force N ≫ 2^n. — other; Erdős problem #1 (erdosproblems.com) — background; Some of my new and almost new problems and results in combinatorial number theory — background; Problems and results in additive number theory — background
- related
- google-deepmind/formal-conjectures/blob/488aade228ec37880b8fec178c173c07d279bb53/FormalConjectures/ErdosProblems/1.lean — builds-on; epoch-research/LeanOpenProblems/blob/77882c437ca1dfefab3b27fa00f1d29788100311/apn/data/erdos/Isolated/Erdos1.erdos_1.lean — builds-on
- divergences
- None known between the compared theorem and the conjecture as stated on erdosproblems.com. The formal conjecture `Erdos1.erdos_1` (Formal Conjectures) reads: there is `C > 0` such that `C · 2^|A| < N` for every `N ≠ 0` and every sum-distinct `A ⊆ {1, …, N}`; the compared theorem is exactly its negation. The hypothesis `N ≠ 0` only excludes the degenerate empty interval. The disproof is ineffective (no explicit `n(ε)`).
- checked by
- nobody independent of its authors yet
Follow and discuss
All discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themFormal material
Formal statements · 1
Recorded elsewhere
Compare the registries- vibemathed — Erdős Problem #1: sum-distinct sets
Also known as · 3
- https://www.erdosproblems.com/1
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/1.lean
- FormalConjectures/ErdosProblems/1.lean
Cite this record
qed.bot, “Erdős Problem 1”, https://qed.bot/s/erdos-1, as of 20 Nov 2026.