https://preview.redd.it/shxpci7g5m3h1.png?width=5650&format=png&auto=webp&s=71aea1c4ddf2d554c5e9732737f8516c8c01a668 So Anthropic software engineer Sholto Douglas just posted on X that their new AI model, Claude Mythos, managed to find a super simple, alternative proof for Erdős’s distinct distances problem. If you haven’t been following the news, this is the exact same combinatorics geometry problem that an OpenAI model disproved just a few days ago. Paul Erdős came up with this question back in 1946 and it went completely unsolved for 80 years, until May 20th when OpenAI’s internal model proved it false. Well, Anthropic’s engineers used this experimental framework called Claude Code, which they’ve been building out since solving Erdős problem #1196. They basically let isolated Claude Mythos agents work independently on different angles, and then one agent pooled all the results together and cleaned up the final version using Claude Opus 4.7. Mathematician Daniel Litt pointed out that while this new proof isn’t quite as rigorous as OpenAI’s massive 125-page document, it’s impressive because the model found two totally alternative solutions. For context, Google DeepMind also knocked out 9 other Erdős problems recently, but they had to use Lean, that special formal proof language. This whole thing really shows how fast these LLMs are moving. It’s wild proof that agentic systems can actually make independent scientific breakthroughs and find theoretical math shortcuts that humans haven’t even thought of. Source: https://the-decoder.com/claude-mythos-reportedly-solves-openais-landmark-erdos-problem-with-a-cute-simple-proof/ submitted by /u/andrewaltair
Originally posted by u/andrewaltair on r/ArtificialInteligence