Two smooth summands for every large integer

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

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer ↗

Version 1 / Nov 21, 2026 / CC BY 4.0

Abstract

For every ε>0\varepsilon>0, every sufficiently large integer NN is a sum of two positive integers all of whose prime factors are at most NεN^\varepsilon. We prove this smooth-summand conjecture of Erdős using weighted dilation graphs, a uniform character-energy estimate, and a positive marked principal term.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000277. Pinned manuscript, original Lean statement, development, and verification evidence: https://github.com/Ghuffy1/erdos-334/tree/0f66e1d94275854de3a6bee7d109c4d2b5cecb35

Provenance statement

The manuscript acknowledges extensive AI assistance with exploration, proof development, formalization, verification and preparation. The prior OpenAI nonvanishing result and weighted-dilation methods, and Balog’s rough-target reduction, are credited in the text. This TeX edition inlines the pinned manuscript files, with the same compiled page text.

References

  1. A. Balog, On additive representation of integers , Acta Math. Hungar. 54 (1989), 297--301. doi:10.1007/BF01952060 (https://doi.org/10.1007/BF01952060).DOI
  2. T. F. Bloom, Erdős Problem #334 , Erdős Problems, electronic problem collection. Problem page (https://www.erdosproblems.com/334).link
  3. H. Davenport, Multiplicative Number Theory , third edition, revised by H. L. Montgomery, Graduate Texts in Mathematics, vol. 74, Springer, New York, 2000.
  4. P. Erdős, Problems and results on consecutive integers , Publ. Math. Debrecen 23 (1976), 271--282. Publisher's record (https://doi.org/10.5486/PMD.1976.23.3-4.15).DOI
  5. P. Erdős, Some new problems and results in number theory , in Number Theory (Mysore, 1981), Lecture Notes in Mathematics, vol. 938, Springer, Berlin, 1982, 50--74. Electronic manuscript (https://combinatorica.hu/~p_erdos/1982-32.pdf).link
  6. B. Green, 100 open problems , manuscript, Problem 59. Electronic manuscript (https://people.maths.ox.ac.uk/greenbj/papers/open-problems.pdf).link
  7. OpenAI, The Quasi-Riemann Hypothesis. A Zero-Free Half-Plane ℜs>7/8\Re s>7/8 , preprint, September 30, 2026. Electronic manuscript (https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-Quasi-Riemann-Hypothesis-September-30-2026/paper.pdf).link
  8. OpenAI, Weighted dilation graphs, smooth shifted primes and totient fibers , preprint, September 24, 2026. Electronic manuscript (https://github.com/openai/math/blob/4eaee87548250b2682affda7d05d947c05554bae/preprints/Weighted-Dilation-Graphs-Smooth-Shifted-Primes-and-Totient-Fibers-September-24-2026/paper.pdf).link

Version history

  1. v1 · 60 pagesSubmitted by Liam KruerManuscript accompanying Justin Sun Prize submission JSP-000277. Pinned manuscript, original Lean statement, development, and verification evidence: https://github.com/Ghuffy1/erdos-334/tree/0f66e1d94275854de3a6bee7d109c4d2b5cecb35CurrentNov 21, 2026