The three parts of Erdős Problem 12: counting functions and reciprocal sums
Version 1 / Nov 21, 2026 / CC BY 4.0
Abstract
We give a unified account of the three numbered questions in Erdős Problem 12 for sets in which no element divides the sum of two distinct larger elements. The positive answer to the square-root counting question and the negative answer to a universal power-saving bound are prior AlphaProof Nexus results of Google DeepMind, presented here with attribution. For the reciprocal-sum question, the new argument proves that one absolute constant bounds the reciprocal sum for every such set, finite or infinite. It combines a restriction estimate for sifted integers, congruence restrictions on prime fibres, and a predictable sum over random prime-factor prefixes. A companion Lean development checks the three original questions and the uniform reciprocal bound.
Provenance statement
References
- B. Alexeev, K. Barreto, Y. Li, J. D. Lichtman, L. Price, J. I. Shah, Q. Tang and T. Tao, Primitive sets and von Mangoldt chains: Erdős Problem #1196 and beyond , preprint (2026), arXiv:2605.00301v1 (https://arxiv.org/abs/2605.00301v1).arXiv
- T. Bera and G. K. Viswanadham, Restriction estimates with sifted integers , preprint (2026), arXiv:2512.21640v3 (https://arxiv.org/abs/2512.21640v3).arXiv
- P. Erdős and A. Sárközy, On the divisibility properties of sequences of integers , Proc. London Math. Soc. (3) 21 (1970), 97--101. doi:10.1112/plms/s3-21.1.97 (https://doi.org/10.1112/plms/s3-21.1.97).DOI
- Google DeepMind, AlphaProof Nexus results: Erdős Problem 12(i) , Lean source (2026), Apache License, Version 2.0. Repository commit 0647711a71183c1ea492ad60860776617ce1ea88 . https://github.com/google-deepmind/alphaproof-nexus-results/blob/0647711a71183c1ea492ad60860776617ce1ea88/APNOutputs/ErdosProblems/erdos_12.parts.i.lean.link
- Google DeepMind, AlphaProof Nexus results: Erdős Problem 12(ii) , Lean source (2026), Apache License, Version 2.0. Repository commit 0647711a71183c1ea492ad60860776617ce1ea88 . https://github.com/google-deepmind/alphaproof-nexus-results/blob/0647711a71183c1ea492ad60860776617ce1ea88/APNOutputs/ErdosProblems/erdos_12.parts.ii.lean.link
- H. L. Montgomery and R. C. Vaughan, The large sieve (https://doi.org/10.1112/S0025579300004708) , Mathematika 20 (1973), 119--134.DOI
- H. L. Montgomery and R. C. Vaughan, Multiplicative Number Theory I. Classical Theory , Cambridge Studies in Advanced Mathematics, vol. 97, Cambridge University Press, Cambridge, 2007.
- Plasma AI, Composite-modulus large sieve for Property P , research notes, Erdős Problems (2026), online edition (https://erdosproblems.ai/wiki/research/leads/property_p_sieve_multiplicity), accessed 4 November 2026.link
- PrimeNumberTheoremAnd , formalization project, https://github.com/AlexKontorovich/PrimeNumberTheoremAnd, commit c6c73610b406689c4b58325cbe1342ecca25d755 ; retrieved through https://github.com/lixiang90/chen_theorem, commit 11dcca8fc3ab340358503278c46d72aef072a6e7 .link
- goldbach-lean , large-sieve formalization, https://github.com/subfish-zhou/goldbach-lean, commit 9d4c3a4010d42aedd9e7231bf94386019cfffccc .link
Show all 11 referencesShow fewer references
- G. Tsoukalas, A. Kovsharov, S. Shirobokov et al., Advancing mathematics research with AI-driven formal proof search , preprint (2026), arXiv:2605.22763v2 (https://arxiv.org/abs/2605.22763v2), Appendix B.4.arXiv
Version history
- v1 · 16 pagesSubmitted by Liam KruerManuscript accompanying Justin Sun Prize submission JSP-000051. Pinned original sources, contribution credits and the verification report are listed at https://github.com/TheJustinSunPrize/awards/pull/5537CurrentNov 21, 2026