For nearly 80 years, mathematicians have grappled with a deceptively simple question: how many pairs of points, among n points in a plane, can be exactly one unit apart? This, the planar unit distance problem, posed by Paul Erdős, has resisted resolution. Now, an internal OpenAI model has provided a breakthrough, disproving a central conjecture in discrete geometry.
The prevailing belief, stemming from constructions like the square grid, was that the number of unit-distance pairs grew at a rate close to linear. Erdős himself conjectured an upper bound of n1+o(1). The OpenAI model's proof, however, demonstrates configurations of n points yielding at least n1+δ unit-distance pairs for some fixed exponent δ > 0.
A Surprising Mathematical Synthesis
The proof's origin is as remarkable as its conclusion. It emerged not from a specialized math AI, but a general-purpose reasoning model. This achievement highlights the growing depth of AI reasoning capabilities.