San FranciscoAn AI model found a counterexample Erdős missed since 1946.
Erdős problems are short, self-contained and checkable by construction, close to the ideal case for a system that searches many candidate proofs and verifies each cheaply.
Mathematicians distinguish “solved” from machine-verified as more Erdős problems come under attempt.
Sources: Quanta Magazine