Matching order for Erdős problem 790
Version 1 / Nov 21, 2026 / CC BY 4.0
Abstract
Let be the largest size of a subset guaranteed in every -element set of integers in which no element is a sum of at least two distinct other elements. We give an upper bound of order by propagating mixed averages through a layered construction and lifting repeated-summand relations to distinct summands. Together with Samuel Korsky’s lower bound, this gives matching upper and lower bounds. A linked Lean development proves the upper bound and matching order, with an independent statement bridge.
Provenance statement
References
No bibliography entries.
Version history
- v1 · 7 pagesSubmitted by Liam KruerTeX edition of the public matching-order manuscript for JSP-000649. Pinned publication and contributor credits: https://github.com/Ghuffy1/erdos790-jsp/tree/7c3d195fa10d7b52f4fa4a2165b336396d4b21c0 . Pinned proof and statement bridge: https://github.com/Ghuffy1/erdos790-jsp/tree/0a69771b18df655fe47af2d5fb78a7d125fcd5f0CurrentNov 21, 2026