A uniform square-root lower bound for non-unique sums and a resolution of Erdős problem 14

Primarily AI-generated textHuman understanding: no partsmath.NT — Number Theory

Contributed by Liam Kruer ↗, Jensen Kohlmeyer

Version 1 / Nov 21, 2026 / CC BY 4.0

Abstract

For A⊆N0A\subseteq\mathbb{N}_0, let EA(N)E_A(N) count the positive integers at most NN without exactly one unordered representation as a sum of two elements of AA, allowing equal summands. We prove EA(N)>N/12000E_A(N)>\sqrt{N}/12000 for every integer N≥2⋅1024N\ge 2\cdot 10^{24}. Part I of Erdős problem 14 holds with exponent 1/21/2, and the existence assertion in part II is false. The common finite estimate is EA(2T4)>T2/1000−1E_A(2T^4)>T^2/1000-1 for every integer T≥106T\ge 10^6. The proof combines a triple-sum moment identity, pair counting in an arithmetic progression, and incompatible bounds for a finite generating polynomial.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000052. Pinned Lean source and verification records are listed at https://github.com/TheJustinSunPrize/awards/pull/4902

Provenance statement

The manuscript acknowledges OpenAI Codex assistance for the written argument and Lean proof. This TeX edition preserves the proof, clarifies the domain of Corollary 1.3, and links the later production verification records for both parts.

References

  1. P. Erdős, Some of my forgotten problems in number theory, Hardy--Ramanujan J. 15 (1992), 34--50. Journal PDF (https://hrj.episciences.org/125/pdf).link
  2. The Formal Conjectures contributors, Formal Conjectures: Erdős problem 14, Lean source file FormalConjectures/ErdosProblems/14.lean . Repository (https://github.com/google-deepmind/formal-conjectures). The reported revision is given in Section 7.link
  3. The mathlib Community, The Lean mathematical library, Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP 2020) , ACM, 2020, 367--381. DOI (https://doi.org/10.1145/3372885.3373824).DOI
  4. Conjectures.io, Conjectures validator, source repository (https://github.com/conjectures-io/conjectures-validator). The reported revision is given in Section 7.link
  5. L. Kruer and J. Kohlmeyer, A uniform square-root lower bound for non-unique sums, source manuscript, September 13, 2026, 7 pp., accompanying file Erdos14_PartI.lean .
  6. L. Kruer and J. Kohlmeyer, A negative answer to Erdős problem 14, part II, source manuscript, September 13, 2026, 7 pp., accompanying file Erdos14_PartII_Counterexample.lean .
  7. Justin Sun Prize submission JSP-000052 (https://github.com/TheJustinSunPrize/awards/pull/4902), with unified manuscript PDF (https://github.com/lkruer/conjectures/blob/e88dec4c88e42824b4acd3f9559febe67115471b/problems/erdos-14/paper/proof.pdf).link
  8. Conjectures.io, Erdős problem 14, part i, production verification record (https://conjectures.io/results/dce3d778-6f52-4c27-8da0-c82d2f391b64).link
  9. Conjectures.io, Erdős problem 14, part ii, production verification record (https://conjectures.io/results/adb53fba-0b01-4398-abab-cb9b2176eebc).link
  10. Pinned original-source edition (https://github.com/JENW1N/complete-math-solutions/tree/a624e9de77e0bd8868e7103f8b379f9dbd86b607). Local verification reports for part i (https://github.com/JENW1N/complete-math-solutions/blob/a624e9de77e0bd8868e7103f8b379f9dbd86b607/verification/erdos14i.json) and part ii (https://github.com/JENW1N/complete-math-solutions/blob/a624e9de77e0bd8868e7103f8b379f9dbd86b607/verification/erdos14ii.json).link

Version history

  1. v1 · 8 pagesSubmitted by Liam KruerTeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000052. Pinned Lean source and verification records are listed at https://github.com/TheJustinSunPrize/awards/pull/4902CurrentNov 21, 2026