How AI Is Reviving Erdős’s Unsolved Math Puzzles and Advancing Pure Mathematics

The article reviews how AI systems—from OpenAI’s internal models to DeepMind’s agents—have begun solving longstanding Erdős problems, detailing specific breakthroughs, the iterative LLM methodology, and the emerging paradigm of AI‑augmented pure mathematics research.

Data Party THU
Data Party THU
Data Party THU
How AI Is Reviving Erdős’s Unsolved Math Puzzles and Advancing Pure Mathematics

Erdős problems and recent progress

Paul Erdős posed over a thousand problems, many in number theory, combinatorics, and graph theory, that appear simple but have resisted solution for decades.

Thomas Bloom curated an online list of these problems. Between 2024 and early 2025, the status of 111 entries changed from “unsolved” to “solved.” In October 2025, Wouter van Doorn posted a comment on problem 1102 and supplied a non‑AI proof the following month.

AI‑assisted attempts

Kevin Barreto and Liam Price used large language models (LLMs) to attack problem 333. Their generated solution was later found to duplicate an existing proof, but the experiment motivated further exploration.

On 4 January 2026, the team employed GPT‑5.2 Pro to produce a proof for problem 728. The logical steps of that proof were independently validated by another AI tool named Aristotle.

Price described a repeatable workflow: query a chatbot for a candidate solution, feed that solution to a fresh chatbot instance for verification, and iterate until the output satisfies the verification step.

The concentration of Erdős problems in number theory, combinatorics, and graph theory makes them comparatively tractable for current LLMs, which handle symbolic reasoning in these domains better than in other areas of mathematics.

Institutional breakthroughs

On 20 May 2026 OpenAI announced that an internal, non‑public model solved a 1946 Erdős problem (the unit‑distance conjecture). The announcement included a blog post, a peer‑reviewed paper, and an evaluation by nine world‑class mathematicians who assessed the proof’s correctness and significance. The counterexample is shown in the image below.

In January 2026 a DeepMind team of 24 researchers published a paper solving four Erdős problems and uncovering nine previously forgotten solutions. In May 2026 another DeepMind group reported that its most capable autonomous agents solved nine of 353 unsolved Erdős problems, each at a cost of only a few hundred dollars.

These results illustrate a new research mode: AI systems can explore vast mathematical spaces, propose novel connections, and generate candidate proofs that human mathematicians can inspect and refine.

Key artifacts

https://arxiv.org/abs/2605.22763

https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-proof.pdf

Unit‑distance counterexample
Unit‑distance counterexample
Original Source

Signed-in readers can open the original source through BestHub's protected redirect.

Sign in to view source
Republication Notice

This article has been distilled and summarized from source material, then republished for learning and reference. If you believe it infringes your rights, please contactadmin@besthub.devand we will review it promptly.

Large Language ModelsOpenAIDeepMindGPT-5.2AI mathematicsErdős problemspure mathematics
Data Party THU
Written by

Data Party THU

Official platform of Tsinghua Big Data Research Center, sharing the team's latest research, teaching updates, and big data news.

0 followers
Reader feedback

How this landed with the community

Sign in to like

Rate this article

Was this worth your time?

Sign in to rate
Discussion

0 Comments

Thoughtful readers leave field notes, pushback, and hard-won operational detail here.