Erdős Problem #123
Statement
Let be pairwise coprime integers. Is every large integer a sum of distinct numbers of the form (), none dividing another?
Context
A numbered Erdos problem that an unusually dense reference trail on erdosproblems.com (6 sources), setting it above the typical entry in the catalog.
People
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.
GPT-5.6 (prompted by Colin Snyder) resolved the Erdős-Lewin conjecture in the affirmative.
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
Marked proved (Lean) on erdosproblems.com; carried an Erdős prize of USD 250. Formally verified in Lean.
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.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.