Kuki Ladron de Guevara/Shutterstock
Since 1946, mathematicians have struggled to answer what seems, on the surface, to be a fairly simple question: How can you arrange an arbitrary number of points on a 2D plane to maximize the number of pairs that are exactly one unit apart? Traditional approaches have typically focused on grid-based layouts, but in May 2026, OpenAI claimed that one of its general-purpose reasoning models had disproven assumptions about this problem that have held for 80 years.
Previously, many mathematicians, including the problem's creator, Paul Erdős, believed that creating a grid of points with carefully chosen spacing was the optimum strategy. The problem is that the number of pairs was constrained by the size of the grid itself. In simple terms, OpenAI's model used advanced algebraic number theory to find a way to arrange points that resulted in a significantly higher number of valid pairs.…