The board / number theory / #587
Erdős Problem #587
SOLVEDdatabase updated 2025-08-31
Resolved in some way other than a straight proof or disproof — usual for open-ended questions, or for multi-part problems whose parts went different ways.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
`MaxNotSqSum N` is the size of the largest subset `A` of `{1,...,N}` such that for all non-empty `S ⊆ A`, the sum `∑ n ∈ S, n` is not a square.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · 1 further variant / known partial result in the Lean file. The authoritative wording is on erdosproblems.com/587.Prizenone
Topicsnumber theory
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA372040
Original pageerdosproblems.com/587
Attempts
submit one →If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.