Erdős Problem #326
Everything below was recorded by a tool. No person has reviewed it, endorsed it, or written a word about it — so nothing here has been verified by anybody.
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.
Context
Affirmative answer claimed, contrary to the negative answer Erdős and Graham conjectured; erdosproblems.com still lists the problem open
A numbered problem from the Erdos catalog: real and documented, with a specialist audience. Checked against erdosproblems.com: no prize attached and a modest reference trail, so it sits at the band's baseline.
People
Projects
Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.
Interest
Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.
Attempts
No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
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.
Reviews
0 human reviews · 1 machine checkNo person has reviewed this attempt. 1 machine check below — a machine check is not human verification.
Machine check · not human verification
machine: correctscope 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.
No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.
Endorsements
0 endorsementsNo one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.
Discussion of this attempt
no comments
Discussion
Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.