OpenAI's internal AI model just solved an 80-year-old math problem ‪—‬ and mathematicians verified it

The closest the field has come to solving the planar unit distance problem, first proposed in the 1940s, was in 1984. Now, OpenAI claims an internal model has cracked the puzzle.

Unit distances on a rescaled square grid.
How many unit distances can you fit on a single piece of paper? OpenAI says one of its models knows.
(Image credit: OpenAI)

An artificial intelligence (AI) model has solved an 80-year-old math problem in a feat hailed as a major milestone for AI's mathematical ability.

The planar unit distance problem, first posed by Hungarian mathematician Paul Erdős in 1946, asks a seemingly simple question: What is the maximum number of pairs of points that can exist one unit apart on a two-dimensional plane? Erdős claimed this number would rise slightly faster than the number of dots.

Drew is a freelance science and technology journalist with 20 years of experience. After growing up knowing he wanted to change the world, he realized it was easier to write about other people changing it instead. As an expert in science and technology for decades, he’s written everything from reviews of the latest smartphones to deep dives into data centers, cloud computing, security, AI, mixed reality and everything in between.

You must confirm your public display name before commenting

Please logout and then login again, you will then be prompted to enter your display name.