GPT-5.2 Pro Solves Its Third Erdős Problem in Days, Verified by Terence Tao

OpenAI's most powerful model has crossed from benchmark performance into genuine mathematical discovery, cracking multiple previously unsolved Erdős problems that have been accepted by the world's most prominent living mathematician.

GPT-5.2 Pro has solved its third Erdős problem in a matter of days — not a benchmark exercise, not a reformulation of known results, but an open problem in combinatorial mathematics that professional mathematicians have struggled with for decades. The solutions have been reviewed and accepted by Terence Tao, the Fields Medal-winning mathematician at UCLA, as @VraserX reported in a post that went viral across AI and mathematics communities alike.

The latest solve is Erdős problem #729, as first noted by @kimmonismus. While the specific mathematical content of the problem hasn't been widely detailed in social media discussion, the pattern is unmistakable: three verified solutions to open Erdős problems in rapid succession represents a pace that would be extraordinary for any research group, let alone a single system operating over the span of days rather than years.

Get our free daily newsletter

Get this article free — plus the lead story every day — delivered to your inbox.

Want every article and the full archive? Upgrade anytime.

No spam. Unsubscribe anytime.