A mathematician working at Anthropic says he used the AI model Claude Fable 5 to uncover a remarkably simple counterexample to the Jacobian conjecture, a famous problem that has resisted ...
the Collatz conjecture, created with AI assistance, was accepted by the theorem proving system Lean, but it was discovered that it actually exploited a bug in the core of Lean. Leonardo de Moura, the ...
While more than 60 million people in the United States watched the FIFA World Cup final on July 19, an artificial intelligence model was hard at work solving—or technically, disproving—a decades-old ...
As millions of people were coming down from the excitement of the FIFA World Cup Final at the start of this week, a different kind of excitement was building within the mathematical community. Levent ...
A young mathematician teamed up with a new AI model to tackle one of the hardest open problems in mathematics, and the result is causing a stir among mathematicians and AI researchers on X. Levent ...
An Anthropic AI model, Claude Fable 5, helped disprove the 87-year-old Jacobian conjecture, a famous open problem in mathematics dating to 1939. The model produced a concrete counterexample that ...
An attempt to bring unequivocal clarity to one of the most controversial areas of mathematics has so far come to nothing. Mathematicians have been working on using a computer to check an apparent ...
On Sunday evening, as Spain and Argentina played out the World Cup final, the mathematician Levent Alpöge posted a short message on X. The Jacobian conjecture, he wrote, is false. He thanked a friend ...
The Jacobian conjecture is a long-standing open problem in algebraic geometry that's bedeviled highly accomplished mathematicians for almost 90 years. It was included in "Smale's problems," a list of ...
Kevin Lieber of Vsauce2 examines why the Collatz Conjecture is still a complex mathematical mystery. Toyota's Ford Maverick fighter just got a lot more real JD Vance and the Trump team keep moving the ...
Think about placing dots on a flat surface. You want as many pairs as possible to be separated by the same distance. For any amount of dots, what is the greatest possible number of pairs that can be ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results