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.

P vs. NP asks: are these two classes actually the same? If P = NP, then every “hard” problem is secretly fast to solve; we ...

Looking for help with today's New York Times Pips? We'll walk you through today's puzzle and help you match dominoes to tiles ...

Mathematician Will Sawin discusses his experience reviewing and refining a mathematical proof devised by OpenAI's internal ...