OpenAI reasoning model disproves historic Erdős math conjecture
- Source
- OpenAI
- Time
- 8:07 PM
- Weight
- 96/100
OpenAI has announced that one of its internal reasoning models has disproved a longstanding conjecture in discrete geometry originally posed by Paul Erdős in 1946. The planar unit distance problem asks for the maximum number of pairs of points that can be exactly one unit apart in a set of $n$ points.
For decades, mathematicians believed that the growth rate of these pairs was nearly linear, but the AI model successfully constructed an infinite family of examples showing a polynomial improvement, thereby refuting the historic upper bound conjecture. The proof is significant not only for its mathematical impact but also for the method by which it was discovered.