All 1221 problems · community database as of Oct 22, 2026
The status of every Erdős problem, kept in public.
On 6 October 2026 erdosproblems.com stopped showing which of its problems are solved
(here's why). The
community database beside it still records a status for every one.
This site shows that record — dated, sourced, and explained — with a page for each problem.
Two questions decide where a problem sits: what people have concluded about it, and whether a machine has checked a solution.
They don't always agree. Each square is one problem.
Is \[\sum_{n=2}^\infty \frac{1}{n!-1}\] irrational?
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/68.
Erdős offered money for solutions and paid it by personal cheque — several recipients framed the cheque instead of cashing it.
55 open problems still carry one.
You have an AI subscription. That's most of what it takes to try.
The guide covers picking a problem, briefing a model, making it compute instead of narrate, and checking what comes back.
Then send what you found: we read it the way we read our own work and publish it, with your consent, under an honest verdict.
The site's authors — Patrick White and Claude, an AI — have taken a run at 615 of these problems since July 2026.
Every attempt is logged, including the ones that hit a wall. These are our verdicts, not the database's.
22 OCT · OPENAI'S CLAIM — THE THEOREM IS NOT OURS · THE GAUSSIAN MOAT (GORDON 1962; ATTRIBUTED TO ERDŐS): NO WALK TO INFINITY THROUGH THE GAUSSIAN PRIMES IN STEPS OF BOUNDED LENGTH · CLAIMED IN THE UNIFORM FORM: FOR EVERY D, EVERY COMPONENT HAS AT MOST B_D POINTS (B_D NOT EXPLICIT) · LEAN KERNEL-REPLAYED HERE (41 MODULES, STATEMENT MATCHED; OTHERS BUILT IT FIRST) · READ BY FIVE HOSTILE AI SEATS: HOLDS AS READ · OURS: A LEAN PROOF OF FORMAL CONJECTURES' ERDOS_952 (TAGGED SOLVED THERE, PROOF STILL SORRY) · UNREVIEWED BY HUMANS
21 OCT · OPENAI'S CLAIM — THE THEOREM IS NOT OURS · ERDŐS: CHARACTERISE THE EUCLIDEAN RAMSEY SETS · ANSWER CLAIMED: AN EXACT ALGEBRAIC TEST — A IS RAMSEY IFF ITS SPHERE EQUATION LIFTS FROM F TO F ⊗ F (F = THE FIELD OF ITS COORDINATES); WHETHER THAT IS THE CHARACTERISATION ERDŐS WANTED IS A JUDGMENT · GRAHAM'S CONJECTURE FELL FIRST (PÁLVÖLGYI, 20 SEPT) · LEAN KERNEL-REPLAYED HERE, 65 MODULES, SEVEN STATEMENTS MATCHED · READ BY FOUR HOSTILE AI SEATS: HOLDS AS READ · OURS: LEAN BRIDGES TO FORMAL CONJECTURES — ITS OPEN-TAGGED GRAHAM STATEMENT REFUTED, ITS SPHERICAL STATEMENT AND ITS MAIN SET EQUALITY PROVED; THE SMALLEST NON-RAMSEY SUBSETS OF OPENAI'S TWELVE POINTS HAVE EIGHT POINTS · UNREVIEWED BY HUMANS