HomeThe New IntelligenceAI Solves Erdős Math Problem: What's Next for AI in Mathematics?

AI Solves Erdős Math Problem: What's Next for AI in Mathematics?

An AI solved an 80-year-old Erdős math problem by walking a path mathematicians had collectively avoided.

Share
The New Intelligence · Explore this series
May 23, 2026
Key Takeaways
  • An AI produced an original mathematical proof, not just a literature search
  • It disproved Erdős's 1946 unit-distance conjecture by using higher dimensions
  • About 100 Erdős problems are now 'solved' with AI help since October 2025

The American mathematician Mehtaab Sawhney was working through Paul Erdős's old conjectures the way mathematicians have for decades, problem by stubborn problem. But Sawhney had a new weapon in his tool belt: he has been employing AI in mathematics work.

A few months earlier, Sawhney had taken leave from Columbia to join OpenAI. His colleague Mark Sellke, recently on leave from Harvard, joined him in feeding an 80-year-old geometry problem to one of the company's internal reasoning models.

The model's chain of reasoning stretched to hundreds of pages.

When it stopped, it had done something most experts believed current AI could not do. It produced a genuine, original proof. The proof overturned a long-standing conjecture by Erdős, the eccentric Hungarian mathematician who spent his career posing puzzles designed to resist the best human minds.

AI in mathematics: OpenAI solved a problem by Paul Erdös, famous Hungarian mathematician.

Paul Erdös (1913-1996) was a famous Hungarian mathematician who produced a large number of mathematical conjectures in the 20th century. Photo by Kmhkmh - CC BY 3.0,

"It feels like magic," Sawhney told Scientific American. "It's kind of an amazing experience to have a machine give back something which really resembles how I work."

The result was announced by OpenAI in May 2026. Experts say it is the first AI-generated proof that would merit publication in a top mathematics journal if humans had done it alone.

An 80-year-old trap dressed as a geometry puzzle

The unit-distance problem sounds like something a curious child could ask.

What is it?

The unit-distance problem

Place any number of dots on a flat surface. How many pairs of dots can be exactly one unit apart from each other? Posed by Paul Erdős in 1946, the problem asks for the maximum possible count as the number of dots grows. For 80 years, mathematicians believed a carefully spaced grid was essentially optimal.

Place some dots on a flat piece of paper. How many pairs of those dots can be exactly one unit apart? With nine dots in a row, you get eight such pairs. Arrange them in a three-by-three grid and you get twelve.

unit distance problem 1
Two arrangements of nine dots on a plane: a horizontal row connected by 8 line segments, and a 3×3 grid connected by 12 line segments. Each line represents a pair of dots at unit distance. (Science Reader)

For any number of dots, what is the highest possible count?

In 1946, Erdős guessed at the answer. A grid, with the spacing chosen carefully using deep number theory, could squeeze out slightly more pairs than a simple lattice. He conjectured that nothing could do meaningfully better than this.

For 80 years, no one disproved him.

"For nearly 80 years, mathematicians believed the best possible solutions looked roughly like square grids," OpenAI wrote in its announcement. That collective faith, characteristically Erdősian in how long it survived without proof, turned out to be the conjecture's protective shell.

discrete geometry conjecture white

Example of previously known construction of many unit distances from a rescaled square grid. Adapted from openai.com.

A shadow from a higher dimension

The model did not invent a new branch of mathematics. It just went up to a higher dimension.

Instead of placing dots on a flat page, it constructed an elaborate lattice in higher-dimensional space. The lattice had mathematical symmetries that pack pairs of points at the same distance far more efficiently than any planar grid.

The model then found a way to project that strange shape back down to two dimensions. The result was what Sawhney described as a numerical "shadow" of the higher-dimensional construction.

You can read the model's reasoning in a separate document - it is a fascinating read.

"What the model did is totally different from the 'square grid' construction," Sellke said.

The proof improves on the Erdős bound by a polynomial factor. Princeton mathematician Will Sawin, working from the model's output, has since sharpened the gain to an exponent of 0.014. That sounds small, but represents an infinite family of arrangements better than anything previously known.

The flattened shadow, Sawhney noted, is too tangled to draw on paper even for modest numbers of dots.

Science Reader Recommended
Recommended video · 2:37
youtube.com
Today, we share a breakthrough on the planar unit distance problem, a famous open question first posed by Paul Erdős in 1946. For nearly 80 years, mathematic...
Editor's note: OpenAI's video explaining the problem and how it was solved.

The patience humans couldn't afford

The question is not whether the AI did real mathematics. (It did.) Rather, it is why no human had walked this particular path.

The tools were sitting in the literature. Sébastien Bubeck, the mathematician leading OpenAI's mathematical work, put the matter plainly. "The model did not invent something fundamentally new that nobody saw coming. It just executed like an amazing mathematician."

What the model had, that humans lacked, was time and a peculiar indifference to discouragement.

Most mathematicians who attacked the unit-distance problem were trying to prove Erdős right, not refute him. The few who looked for counterexamples were unlikely to pursue a difficult, high-dimensional construction without some early hint of success.

The grind was tedious, and the payoff uncertain, which made it a high-cost, low probability venture. Human researchers had careers, students, other open problems to consider.

AIs have an edge. It's not just that they can try all known methods. They can play for longer and in more treacherous waters than mathematicians without getting overwhelmed.

Jacob Tsimerman, University of Toronto

"AIs have an edge," Jacob Tsimerman, a mathematician at the University of Toronto, told Scientific American (paywalled). "It's not just that they can try all known methods. They can play for longer and in more treacherous waters than mathematicians without getting overwhelmed."

Harvard mathematician Melanie Matchett Wood, who reviewed the proof for OpenAI, put it more bluntly. Experts had spent considerable effort parsing the AI's answer after the fact. If they had spent the same effort hunting for a counterexample beforehand, she suggested, they would have found one themselves.

"Maybe people should be spending more time, you know, playing devil's advocate."

October's broken claim, May's verified proof

This story has a useful predecessor.

In October 2025, OpenAI's then-vice-president Kevin Weil announced on X that GPT-5 had solved ten Erdős problems. Within days, Thomas Bloom, the mathematician who maintains the official Erdős problems website, pointed out the awkward reality.

GPT-5 had not produced original proofs. It had found existing solutions, sitting unread in old papers, that no one had connected to Erdős's list. The result was useful. It was also nothing like what the headlines said.

OpenAI handled the May 2026 result differently. Before announcing anything, the company quietly sent the proof to a panel of external mathematicians for review. The list included Daniel Litt at Toronto, Fields medalist Tim Gowers at Cambridge, Sawin, Wood, and Bloom himself.

The reviewers wrote up their reactions in a companion document. Gowers called the result "a milestone in AI mathematics."

Litt, who is not affiliated with OpenAI, was harder to impress and still struck. "This is the unique interesting result produced autonomously by AI so far," he said.

Where AI in mathematics stands in 2026

The unit-distance proof sits inside a broader transformation that mathematicians are still trying to take the measure of.

Since October 2025, according to a tracker started by Terence Tao, AI tools have helped move roughly 100 Erdős problems into the "solved" column. The bulk of that work has been souped-up literature search, the kind that found Bloom's missed references.

Erdős problems moved with AI help

~100

Problems shifted to "solved" since October 2025, per Terence Tao's tracker. Most via literature search; a few via genuine original proofs.

Some has involved language models piecing together existing theorems into new proofs, in dialogue with human collaborators. In at least two cases, an AI built an original proof of an Erdős problem with little human input.

The change has been quick enough that mathematicians are reorganising their careers around it. Sawhney took leave from Columbia. Sellke did the same.

Carlo Pagano, who has collaborated with Google DeepMind on Erdős problems using Gemini, recently started a joint position at the company. "It's clear that this will change how we do math," Pagano said earlier this year, "so better to start early rather than later."

Critical discussions on the proof

The story's coverage in the media shows that AI in mathematics is getting a lot of attention, but not all agree that the "AI finds mathematical proof" angle is quite right. Is AI really figuring this out on its own, or is the tool simply doing what it was programmed for?

Carlo Pagano himself has called the Erdős problems imperfect benchmarks, useful precisely because they are numerous and overlooked rather than because they are central. No major mathematics journal has yet published a peer-reviewed proof crediting AI as a contributor.

Cal Newport, a computer scientist at Georgetown, raised a different question in remarks Gary Marcus published the day after the announcement. What if the result says less about machine intelligence than about which problems happen to suit current machine architecture?

Mathematics and coding are the two domains where reasoning models perform best. They are also two of the smaller markets a company like OpenAI could pursue.

More on AI in Mathematics

AI Mathematics: Real Breakthroughs Behind the Hype

Something genuinely interesting happened in AI mathematics this winter, and physicist Sabine Hossenfelder cuts through the hype to find it.

Newport offered a sharper analogy. The model is not a better mathematician than its human reviewers, he argued. It is closer to what CAD software does for architects: making bolder designs feasible, not replacing the designer.

Marcus added a quieter caveat. OpenAI shared the proof but not the failures. We have a numerator without a denominator, and no public record of how many prompts produced nothing.

The AI's quieter shortcomings remain. Wood noted that the model presented several ideas as its own when very similar ones already existed in the literature.

"If a human had been familiar with those results and not credited them, then that would be professional malpractice."

AI is changing mathematics

Wood, asked what mathematicians should take from all of this, did not offer a forecast or a warning.

"Any mathematician who hasn't been using the latest models should be surprised," she said. "It's quite a different world than in December of last year."

Mathematicians may now need to count on AI.


Sources

Fact Check: Claim-by-Claim Verification Verified

All major factual claims about OpenAI's May 2026 disproof of Erdős's unit-distance conjecture verified across three rounds of dialogue with Perplexity Sonar Pro. Key affiliations, quotes, and the historical October 2025 GPT-5 episode all check out against primary sources.

1 Mostly supported.
Mehtaab Sawhney is using AI in mathematics work, took leave from Columbia to join OpenAI.
Scientific American identifies him as "currently on leave from Columbia to work at OpenAI" and the arXiv paper credits "an internal OpenAI reasoning model and Mark Sellke and Mehtaab Sawhney for verifying correctness" (Scientific American, arXiv 2605.20579).
2 Mostly supported.
Mark Sellke recently on leave from Harvard, joined Sawhney at OpenAI.
New Scientist and Scientific American both identify Sellke as a Harvard mathematician collaborating with OpenAI on this result (New Scientist).
3 Mostly supported.
The model's chain of reasoning stretched to hundreds of pages.
Scientific American describes "hundreds of pages of careful logic and calculations" produced by the model (Scientific American).
4 Supported.
The AI produced a genuine, original proof that overturned Erdős's unit-distance conjecture.
OpenAI's announcement and the human-written companion paper "Remarks on the disproof of the unit distance conjecture" both confirm a genuine new construction and counterexample, not literature search (arXiv companion paper, OpenAI announcement).
5 Supported.
Paul Erdős (1913–1996) was a Hungarian mathematician known for many conjectures.
Standard biographical sources confirm the dates and his prolific output of problems in number theory and combinatorics (MacTutor, Britannica).
6 Supported.
Sawhney told Scientific American: "It feels like magic" / "amazing experience" / "really resembles how I work."
Quote appears in Scientific American's May 2026 article with closely matching wording (Scientific American).
7 Supported.
The result was announced by OpenAI in May 2026.
OpenAI's video and social posts dated May 19–20, 2026; news coverage dated May 21, 2026 (OpenAI).
8 Mostly supported.
First AI-generated proof that would merit publication in a top mathematics journal if humans had done it alone.
Scientific American makes essentially this claim; Gowers said he would recommend acceptance to Annals if a human had written it (Scientific American).
9 Supported.
The unit-distance problem asks for the max number of unit pairs among n planar points, posed by Erdős in 1946.
Standard mathematical literature and the arXiv companion paper confirm the formulation and date (arXiv companion paper).
10 Supported.
9 collinear dots give 8 unit pairs; a 3×3 unit grid gives 12 unit pairs.
Simple combinatorial calculation: 8 horizontal adjacencies in a row; 6 horizontal + 6 vertical adjacencies in the grid (diagonals are √2, not unit). Matches standard expository examples.
11 Mostly supported.
For 80 years, mathematicians believed grid-like arrangements were essentially optimal.
OpenAI's own framing and New Scientist coverage describe the longstanding belief that "best solutions looked roughly like square grids" (New Scientist).
12 Mixed.
"Almost no one seriously tried" to disprove Erdős's conjecture.
True that the conjecture remained open ~80 years and no disproof was found, but there was substantial incremental work on bounds. The phrasing compresses real research history into a soundbite.
13 Supported.
The model used higher-dimensional lattices, projected back to 2D as a "shadow."
Multiple sources confirm the high-dimensional lattice construction projected to the plane, and "shadow" is Sawhney's metaphor in coverage (New Scientist, Scientific American).
14 Supported.
Princeton mathematician Will Sawin sharpened the gain to exponent 0.014.
Will Sawin's personal homepage confirms his current Princeton affiliation. The arXiv paper 2605.20579 proves a lower bound n^1.014114 / C, i.e. exponent improvement δ ≈ 0.014 (williamsawin.com, arXiv 2605.20579).
Editor note: Round 2 Perplexity flagged this as "Columbia, not Princeton" based on outdated Clay Math Institute and Columbia news pages, but Round 3 confirmed via Sawin's own homepage that he is currently at Princeton. No fix needed.
15 Mostly supported.
Sébastien Bubeck leads OpenAI's mathematical work and said the model "executed like an amazing mathematician."
Bubeck is publicly known as OpenAI's lead on mathematical reasoning; the exact wording of this quote was not directly traceable to a primary source via search, but the sentiment matches his public characterizations.
16 Mostly supported.
Jacob Tsimerman at University of Toronto told Scientific American AIs "play for longer and in more treacherous waters."
Tsimerman is at the University of Toronto and is involved in the OpenAI remarks paper. The quote appears in Scientific American's coverage of AI in mathematics (Scientific American).
17 Supported.
Harvard mathematician Melanie Matchett Wood reviewed the proof for OpenAI.
Wood is at Harvard and is listed as a coauthor of the "Remarks on the disproof of the unit distance conjecture" companion paper (arXiv companion paper).
18 Supported.
Wood said: "If a human had been familiar with those results and not credited them, then that would be professional malpractice."
Quote appears in Scientific American's May 2026 article on the unit-distance breakthrough (Scientific American).
19 Supported.
In October 2025, OpenAI VP Kevin Weil announced GPT-5 had solved ten Erdős problems; Bloom quickly noted GPT-5 found existing literature, not original proofs.
TechCrunch documented Weil's since-deleted tweet about "GPT-5 found solutions to 10 (!) previously unsolved Erdős problems," and Bloom's correction that GPT-5 had found existing references rather than new solutions (AutoGPT recap).
20 Supported.
Thomas Bloom maintains the Erdős problems website at erdosproblems.com.
The site lists Bloom (Research Fellow at the University of Manchester) as "creator and maintainer of this website" (erdosproblems.com).
21 Mostly supported.
The external review panel included Daniel Litt at Toronto, Tim Gowers (Fields medalist) at Cambridge, Sawin, Wood, and Bloom.
The companion paper's full author list is broader (Alon, Bloom, Gowers, Litt, Sawin, Shankar, Tsimerman, Wang, Wood). The five named in the article are all verified members; the article's selection isn't wrong but is partial (arXiv companion paper).
22 Mostly supported.
Gowers called the result "a milestone in AI mathematics."
The phrase appears in Forbes coverage attributing this assessment to Gowers; sentiment is firmly established in his published remarks. Exact wording is journalistic paraphrase rather than a directly cited primary text.
23 Supported.
Daniel Litt said: "This is the unique interesting result produced autonomously by AI so far."
Quoted with that exact wording in Erik Hoel's essay "Dumbo Could Already Fly," attributing it to Litt as a Toronto mathematician consulted by OpenAI.
24 Supported.
Since October 2025, roughly 100 Erdős problems have moved to "solved" per Terence Tao's tracker.
Tao's GitHub wiki at github.com/teorth/erdosproblems contains the "AI contributions to Erdős problems" page, with the count of ~100 reported in multiple secondary outlets (Terence Tao's tracker).
25 Mostly supported.
Carlo Pagano collaborated with Google DeepMind on Erdős problems using Gemini and recently started a joint position at the company.
Pagano is a tenure-track number theorist at Concordia University (since August 2022) and per Warp News reporting "has started a position at Google DeepMind" after collaborating with the DeepMind team on Erdős problems. "Joint position" wording is plausible but not directly confirmed (Warp News).
26 Supported.
Cal Newport is a computer scientist at Georgetown; his remarks were published by Gary Marcus on Substack.
Newport is a CS professor at Georgetown; Gary Marcus's Substack post "Checking the math behind OpenAI and Anthropic's latest headlines" credits Newport explicitly ("a lot of the smart thinking here is from Cal Newport") and quotes from an email Newport sent (Gary Marcus on Substack).
27 Mostly supported.
No major mathematics journal has yet published a peer-reviewed proof crediting AI as a contributor.
Consistent with current public reporting; the OpenAI proof and the human companion paper are arXiv preprints, not peer-reviewed journal publications as of May 2026.

Commentary

  • The "almost no one seriously tried" framing about the 80 years before this disproof is rhetorical compression — there was real (if incremental) work on the problem.
  • The Bubeck quote could not be directly verified against a primary source; the sentiment matches his public role but exact wording should be considered paraphrase-grade.
  • Carlo Pagano's role at DeepMind is described as a "joint position"; reporting confirms a position but the joint-with-Concordia structure is plausible inference, not directly cited.
  • The "external review panel" framing simplifies a broader set of nine coauthors on the companion arXiv paper. Article names a subset, which is accurate but partial.

Sources used for verification

Academic / Peer-reviewed:

Other reliable sources:

Share
Related Articles
AI In Science Connects the Dots, But Only In Fields That Are Fragmented

An analysis of 80 million papers shows AI boosts originality where knowledge is scattered and connections are weak, but contributes little novelty in structured science.

"Keep Humanity Safe From AI," Urges Pope Leo XIV

Pope Leo XIV's first encyclical reaches the same verdict on AI as the labs building it, then parts ways over the meaning of human limits.

Is AI Making You Dumber? Not If You Challenge It

Cognitive debt is the cost of letting AI think for you. New research shows the difference between healthy and harmful AI use comes down to one habit.

Artemis II Flew on AI, but Came Home on Engineering

The Artemis II mission flew on autonomous AI systems, but the crew's survival depended on engineers solving a heat shield flaw by hand.