AI Cracks 80-Year-Old Erdős Math Problem

AI-generated context summary requested by a Free News Reader user. Sourced via Gemini from publicly available information — no paywalled content was accessed.

You hit a paywall. Here’s the context on this topic based on publicly available information. We did not access any paywalled content. View original article.

AI Cracks 80-Year-Old Erdős Math Problem

Full Summary — powered by AI

An artificial intelligence model from OpenAI has achieved a significant milestone in mathematics by independently solving the planar unit distance problem, an 80-year-old open question posed by Hungarian mathematician Paul Erdős in 1946. The problem asks, for a given number of points in a plane, what is the maximum number of pairs that can be exactly one unit distance apart. For decades, mathematicians largely believed that square grid arrangements were essentially optimal for this problem.

On May 20, 2026, OpenAI announced that an internal reasoning model disproved this long-held assumption. The AI achieved this by discovering a new family of constructions that surpass the limits previously conjectured by Erdős. Notably, the solution was not achieved through brute force or by completing a partial human proof, but by autonomously drawing on advanced tools from algebraic number theory and applying them to the geometric question.

This breakthrough was made by a general-purpose reasoning model, rather than one specifically trained for mathematics, highlighting the increasing capability of AI in complex reasoning tasks. The work has been validated by leading mathematicians, including Thomas Bloom, who maintains the Erdős problems website, and Fields medalist Tim Gowers, who called the result “a milestone in AI mathematics.” Noga Alon,

Generated by Free News Reader. This summary provides topic context based on publicly available information. We encourage supporting quality journalism by subscribing to the original publisher.