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.

A new quantum-inspired algorithm has cracked a problem so massive that conventional supercomputers struggle to even approach it. Researchers used the method to simulate extraordinarily complex quantum ...

Researchers say the findings raise questions about what happens to our brains and patterns if we depend too much on AI. Dashia is the consumer insights editor for CNET. She specializes in data-driven ...

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

Little progress had been made in solving Ramsey problems since the 1930s. Now, researchers have found the answer to r(4,t), a longstanding Ramsey problem that has perplexed the math world for decades.

In 1946, the mathematician Paul Erdős posed the unit distance problem—and suggested a winning strategy. An A.I. model has now ...

Last week, OpenAI shocked the mathematical community by revealing that one of its internal artificial intelligence (AI) ...

Only a few months ago, the question felt mostly philosophical: if artificial intelligence can help solve open math problems, ...

Five steps to ensure that you don’t jump to solutions by Julia Binder and Michael D. Watkins When business leaders confront complex problems, there’s a powerful impulse to dive right into “solving” ...

For nearly 80 years, mathematicians have struggled to solve a classic geometry puzzle first posed by Paul Erdős in 1946: the ...