Why the Legendary Erdős Problems Are Falling to AI

·Quanta Magazine··

On May 20, 2026, OpenAI made an announcement that shook the mathematical world. An internal AI model — one not available to the public — had come up with a counterexample to the “unit distance” problem, a conjecture made in 1946 by Paul Erdős, the prolific, itinerant Hungarian mathematician. Erdős posed thousands of questions, but this one was special: It was both simple to explain and… Source

Read full article →

Related Articles

Ten advances in mathematics and theoretical computer science
milkshakes · Hacker News · 1h ago
US–Indian space mission maps extreme subsidence in Mexico City
leopoldj · Hacker News · 3mo ago
OpenAI's claimed disproof of Connes' Rigidity Conjecture is invalid [pdf]
muglug · Hacker News · 1d ago
Why are neural networks and cryptographic ciphers so similar? (2025)
jxmorris12 · Hacker News · 3mo ago
The gauge broke: devs felt 20% faster with AI, measured 19% slower
intrepidkarthi · Hacker News · 1mo ago