Tag
A researcher reports spending three months running Claude Code and Codex on Erdős Problem #993 (unimodality of independent-set sequences in trees), only to learn that Tong Zhang and Wei Li posted a full proof last week, along with two Lean 4 formalizations that claim a clean build. The result is not yet peer-reviewed.
Aleph Prover has formalized OpenAI's disproof of Paul Erdős' planar unit problem in Lean 4 and released it as open source for independent validation, demonstrating AI's role in accelerating mathematical research with verifiable proof data.
Anthropic's new AI model Claude Mythos, using the Claude Code framework, reportedly solved Erdős's distinct distances problem by finding alternative simple proofs, following OpenAI's earlier disproof. This demonstrates LLMs' ability to make independent scientific breakthroughs.
Over the weekend, Mythos was tested on the Erdos unit distance problem (Problem #90) and successfully solved it.
An OpenAI researcher claims that their model's solution to an Erdős problem in discrete geometry is the biggest AI achievement to date, but predicts it will be overshadowed by end of year.
OpenAI claims its new reasoning model autonomously produced an original mathematical proof disproving an 80-year-old unsolved geometry conjecture by Paul Erdős, marking the first time AI has solved a prominent open problem central to a field of mathematics.
OpenAI has achieved a breakthrough in mathematics: an AI model autonomously solved the planar unit distance problem, a famous open question from 1946, by discovering a new family of constructions that outperform square grids. This marks the first time AI has independently solved a prominent open problem in mathematics.
An OpenAI model has autonomously solved the planar unit distance problem, a famous open question in mathematics posed by Paul Erdős in 1946, by discovering a new family of constructions that outperform square grids. This marks the first time AI has autonomously proven a prominent open problem in mathematics.