arXiv · 2611.21136
Sums of Integers with Small Prime Factors
Abstract
Let $P^+(n)$ denote the largest prime factor of $n$, with $P^+(1)=1$. We prove that, for every $β>103/(256\sqrt e)$, there is a constant $C=C(β)>0$ such that every sufficiently large integer $N$ can be written as $N=a+b$, where $a,b\in\mathbb{Z}_{>0}$ and $$ P^+(a)\leq N^β,\qquad P^+(b)\leq(\log N)^C. $$ This strengthens Balog's result, which gives two $N^β$-smooth summands for $β>4/(9\sqrt e)$. The proof combines Balog's argument with convolution estimates that are uniform in the residue class.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sarvagya Jain. 2026-11-16. Sums of Integers with Small Prime Factors. https://searcharxiv.com/abs/2611.21136
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.