Erdős·erdos:488
Erdős Problem 488
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 a Comparator challenge, an alignment table and written divergences.
number theory·Source
AI activity
How grades workNew solution to variant problem (Lean)
Reasoning and sources
Autonomy
AI building on literature supplied to it
Details
literature: 🟡 Cambie (2025)
Sources
Partial result
Reasoning and sources
Autonomy
AI collaborating with humans
Sources
Claimed on erdosproblems.com
3Proof 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 a Comparator challenge, an alignment table and written divergences.
Declared by the projects
2As each project's formalization.yaml states it.
Formal Resolution of Erdős Problem #488
- authors
- Alicienn
- method
- agent — Gemini 4 Carbon (Medium)
- review
- agent-reviewed (Alicienn)
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- sources
- Continual Graph Memory and Community Infrastructure for AI-Assisted Mathematical Discovery — adapts, authors not-contacted; Some unsolved problems — background, authors n/a
- related
- google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/488.lean — builds-on
- divergences
- none known
- checked by
- nobody independent of its authors yet
Erdős Problem 488 has a negative answer: a finite counterexample to the doubling bound for the density of a set of multiples
- authors
- Declan Gessel
- method
- agent — GPT-6 Astra, claude-fable-5-2
- review
- agent-reviewed (Carlos Toledo, with Claude agents (independent certification of the original proof, doi:10.5281/zenodo.24025464), Deicyde (replay of the original proof at Lean and Mathlib v4.33.1; approving review on formal-conjectures PR #5297, 18 September 2026), Jig's verifier (the counterexample without the adapter; jig.so problem 398, statement 40))
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- results
- 1 main results named, checked with Comparator, with an alignment table
- sources
- A finite counterexample to Erdős Problem 488: the integers in (T, 256T] with all prime factors below 257 (Lean proof by Declan Gessel, with GPT-6 Astra, 5 September 2026) — other, authors participated; Erdős Problem #488 — background, authors n/a; Erdős Problem 488 in google-deepmind/formal-conjectures (Erdos488.erdos_488) — other, authors other; How much can the density of a set of multiples grow? The sharp order in a problem of Erdős — background, authors not-contacted
- related
- https://gist.github.com/declangessel/d8e15e5ff1b6c7e99e3d86d7c66f1d08/034be67a5c958e55505bb357f9e4ef3015788465 — other; WoshuaJolk/jig-verifier/blob/ccf4a26cb8a8c49f476d44304070a2b677da4d7e/Submissions/ErdosMultiplesSmoothRefuted/Counterexample.lean — other; https://doi.org/10.5281/zenodo.24025464 — other; shoal-rat/erdos-488-lean — independent
- divergences
- The statement is formal-conjectures' reading of the problem, kept as it is: A is a Finset of natural numbers, nonempty, with 0 ∉ A and 1 ∉ A (a comment in formal-conjectures' file points to its PR #256 for these two; when 1 ∈ A both densities are 1); "n ≥ max(A)" is Finset.max A ≤ n, with Finset.max valued in WithBot ℕ; "m > n" is strict; B is the set {n ≥ 1 | ∃ a ∈ A, a ∣ n}; the densities are the rational numbers card / m and 2 * card / n. The problem's question is answered no, so the theorem is that statement with `¬` in front, as formal-conjectures prescribes for a question answered no; formal-conjectures itself still tags the entry as open. The text was compiled here against Mathlib at v4.35.0, not against formal-conjectures' own Mathlib (v4.33.1): the fully elaborated statement prints identically at both (CHECKS.md), but the definitions beneath it were not compared constant by constant. No other divergence is known.
- 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
Cited proofs · 0
No proof artifact cited by the formal record.
Also known as · 3
- https://www.erdosproblems.com/488
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/488.lean
- FormalConjectures/ErdosProblems/488.lean
Cite this record
qed.bot, “Erdős Problem 488”, https://qed.bot/s/erdos-488, as of 20 Nov 2026.