GPT-5.4 Pro Solves Erdős Problem #1196
Source: Dongruo Zhou on X — Thread summarizing 7 parts
TL;DR
A significant milestone in AI mathematics: GPT-5.4 Pro solved Erdős Problem #1196, an open problem for 60 years. The problem concerns primitive sets of integers — whether for any primitive set A (no distinct elements divide each other), the sum of 1/(a log a) over A is bounded by 1 + o(1). Lichtman had previously proven a bound of approximately 1.399. OpenAI announced this result in June 2026. The proof was constructed through a prompting process by researcher Price. Subsequent work by Jared Duker Lichtman and others refined and adapted GPT-5.4's proof method to prove several additional results. This marks one of the first instances of a frontier LLM independently constructing a novel mathematical proof that experts couldn't find for decades.