no. 16 · Tuesday 17 November 2026
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.
- fields
- Number Theory