Why did Erdős problems become a popular AI testing ground?
Explores what makes Erdős problems attractive for evaluating large language models, including their mathematical domains, difficulty range, and the collaborative infrastructure that enables testing.
Kakaes reports that Erdős problems became a test bed for LLMs because, "by and large," they sit in number theory, combinatorics and graph theory, areas that have "proved more accessible than others to large language models," and because they "vary widely in difficulty." The excerpt's sharper point concerns what follows an answer. It keeps three things apart: a formal check, a model's re-check of another model's output, and a human's understanding. Aristotle, a tool from the startup Harmonic, was used to "certify that the proof held together logically" for Erdős 728. Bloom describes 100- to 200-page AI-generated papers that, in his words, "no human has read it, and no human is going to read it." Van Doorn, by contrast, says that when he reads an LLM's idea he will "digest it, try to understand it, simplify it, and generalize it."
The excerpt treats checking as an iterative loop, not a proof. Price asks a chatbot for a solution, feeds it "into a fresh instance of the chatbot, asking it to check the previous chatbot's work," and repeats "until he had what looked like a workable solution." Company harnesses automate the same loop, according to the excerpt. The word "looked" carries the argument: the procedure ends where another model stops objecting, which is a plausible answer rather than a proof someone has followed. The opposite failure shows in Erdős 333, where Barreto's claimed solution was already in a 1977 Erdős paper, a mistake he owned: "As someone who has fallen for this twice now, it's quite gut-wrenching."
Set against the neighbors, the heuristics note finds the same gap inside a model: transformers trained on orbital mechanics predict trajectories accurately yet apply task-specific laws instead of Newtonian ones, so accuracy alone does not show understanding. In the Erdős case the gap sits with the readers. The Darwin Gödel Machine note replaces formal proof with empirical validation on benchmarks; the Erdős cases keep a formal checker for logic and leave explanation to people. The AIDE2 note lists "untrustworthy wins" among practitioner problems, and the 333 episode is a concrete case of one. The excerpt also says most new results came from "hobbyists and undergraduates using publicly available LLMs" rather than corporate labs, and Bloom says such users are "not capable of verifying the output."
The excerpt measures none of this. It gives no count of AI results checked by experts, no error rate beyond the 333 case, and no verification detail for the DeepMind team's claim that "our most capable agent autonomously resolved 9 of 353 open Erdős problems." The OpenAI announcements of May 20 and August 1 are likewise lab claims, not checked findings. Barreto, Price and Lichtman appear without introduction, and the 333 passage starts mid-story, so passages appear to be missing. What the excerpt supports is narrower than the split it implies: formal certification and human comprehension are reported as different things, and comprehension looks like the part that lags. That lag is asserted, not measured, so a verified Erdős proof should not be read as understood until someone reports having read it.
Inquiring lines that read this note 11
This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.
Can we trust AI-generated mathematical proofs without understanding them?- Why did AI-generated proofs go unread by mathematicians?
- Did automated checking loops actually solve Erdős problems correctly?
- Why do AI systems excel at literature search but struggle with novel proofs?
- How does the Golod-Shafarevich criterion ensure infinitely many suitable number fields?
- Why do some Erdős problem solutions fail to resolve the originally intended claims?
- What evidence exists about whether AI-written proofs reduce mathematician learning?
- How does Kummer's theorem connect base-p digit carries to binomial coefficient divisibility?
- What pattern does this follow from OpenAI's earlier Erdős problem claim?
- Why did OpenAI's Erdős primality claim collapse under independent verification?
- What should mathematicians prioritize when machines can solve problems faster?
- Why do theorem provers crowd out other AI-for-mathematics approaches and tools?
Related concepts in this collection 3
This note in its neighbourhood — explore the map, then jump to a related concept in the list below.
Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph
-
Do foundation models learn world models or task-specific shortcuts?
When transformer models predict sequences accurately, are they building genuine world models that capture underlying physics and logic? Or are they exploiting narrow patterns that fail under distribution shift?
the same gap inside a model: accurate predictions without the general law
-
Can AI systems improve themselves through trial and error?
Explores whether replacing formal proof requirements with empirical benchmark testing enables AI systems to successfully modify and improve their own code iteratively, and what mechanisms prevent compounding failures.
contrast: benchmark validation in place of formal proof; here a formal checker covers logic only
-
What problems did AIDE2's rewrites actually solve?
AIDE2 autonomously improved its own code over eight days. Did the seven accepted changes target real practitioner challenges in building agentic systems, or did they reflect artifacts of the system's own optimization process?
the 333 episode is a concrete untrustworthy win, already known in the literature
Related papers in this collection 8
Papers most semantically related to this note, ranked by cosine similarity in the embedding space.
- Why the Legendary Erdős Problems Are Falling to AI
- Remarks on the disproof of the unit distance conjecture
- From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier
- Verification abundance, adjudication scarcity: what happens to mathematical knowledge when proof checking becomes free
- The crisis of AI-generated mathematics
- Machine-Assisted Proof
- FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming
- Potemkin Understanding in Large Language Models
Original note title
Kakaes reports Erdős problems became a test bed for AI because they are accessible and vary widely in difficulty — and some AI proofs go unread