Loading market data...

OpenAI Model Disproves Long-Standing Erdős Conjecture Using General-Purpose Reasoning

OpenAI Model Disproves Long-Standing Erdős Conjecture Using General-Purpose Reasoning

An OpenAI artificial intelligence model has disproved a major conjecture by the late mathematician Paul Erdős, marking a milestone in autonomous mathematical reasoning. The AI used a general-purpose reasoning system — not a tool built specifically for math — to find a counterexample that mathematicians had failed to uncover for decades.

How the AI cracked the problem

The model was given the conjecture as a logical statement and asked to prove or disprove it. Rather than scanning known papers or running brute-force calculations, the system generated its own chain of reasoning. It identified a hidden assumption in the conjecture and constructed a case that violated it, producing a concrete counterexample.

The team behind the project said the AI wasn't trained on advanced math. It learned basic reasoning patterns from general text and then applied them to the Erdős problem. That's a departure from earlier AI math tools, which rely on massive databases of theorems or symbolic solvers.

Erdős conjectures are notoriously tough. He posed thousands of problems over his career, many still unsolved. The fact that a single, off-the-shelf reasoning model could topple one suggests these systems are getting closer to genuine discovery, not just pattern matching.

Researchers see potential beyond mathematics. The same reasoning approach could be turned on open questions in physics, biology, or cryptography. If an AI can autonomously disprove a conjecture, it can also propose and test new hypotheses. That could shave years off the traditional scientific cycle.

Limits and unanswered questions

The model's success doesn't mean it can solve any problem. The disproved conjecture, while major, was still a finite logical statement. Real-world science is messier — it involves noisy data, incomplete theories, and value judgments. The OpenAI system hasn't yet shown it can navigate those.

It's also unclear how the AI arrived at its counterexample. The reasoning chain is black-box in parts, making it hard for humans to verify every step. That raises trust issues. If an AI disproves a conjecture but we can't fully audit its logic, do we accept the result?

The OpenAI team says they're working on explainability tools. For now, the mathematical community is reviewing the counterexample independently. The paper describing the work has been posted to a preprint server.

What happens next

Other groups are already testing their own models on the same conjecture. Some are trying to see if the AI's counterexample holds up under stricter conditions. The next big test will be whether the system can tackle a conjecture that requires inventing new math — not just breaking existing logic.

The Erdős disproving model is set to be demonstrated at a conference later this year. Until then, mathematicians are left with a question: if an AI can beat them to a counterexample, how many more are waiting in the code?