Erdős Problem #326
Statement
Does there exist which is a minimal basis of order (every large integer is the sum of elements from , and no proper subset of has this property) such that for some ? A claimed construction gives a minimal basis with , answering the question affirmatively; Erdős and Graham had conjectured a negative answer.
Record
- Added
Comments
No person has examined this. Everything below was judged by machines. say whether it holds →
construction · #1
Aron Bhalla, using GPT-5.5, Aristotle, CodexThat credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.
Per the author's disclosure, most of the mathematics is his own, with GPT-5.5 used to stress-test ideas, suggest revisions, identify gaps and write up some proofs; the solution was then formalized over several weeks with Aristotle, Codex and GPT-5.5 into a roughly 15,000-line Lean proof confirming all claims in the manuscript.
Machine-checked by Lean on #1 · not a person
lean: correctLeanscope Lean formalization of the result
The author reports a ~15,000-line Lean formalization, type-checkable online, confirming all claims of the manuscript. It has not been independently audited for statement fidelity, and erdosproblems.com has not accepted the claim: the site's owner found the AI-written exposition hard to digest while stressing that this was not a correctness objection.
Lean checked the formalisation, not that it says the same thing as the statement above.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.