Arithmetic progressions in sumsets of geometric progressions
Michael A. Bennett
TL;DR
The paper investigates arithmetic progressions within the sumset $S_{a,b} = \{ a^x+b^y : x,y\ge0\}$ for integers $b>a>1$, proving a near-complete description of 5-term progressions and a precise list of sporadic 6-term cases. The author combines elementary arguments with deep Diophantine tools—$S$-unit bounds, linear forms in logs, and Frey–Hellegouarch modularity—to bound exponents and exclude most configurations, isolating a small finite set of exceptional $(a,b,N,D)$. A key outcome is that, beyond a few explicit infinite families, the longest possible progressions are highly restricted; the paper also exhibits infinite families of 3- and 4-term progressions in certain $S_{a,b}$. These results sharpen the understanding of how additive structure interacts with exponential growth in double-geometric sumsets and guide directions for higher-term and multi-base generalizations.
Abstract
If $a$ and $b$ are integers with $b>a>1$, we completely characterize ``long'' arithmetic progressions in the sumsets of the geometric progressions $1, a, a^2, a^3, \ldots$ and $1, b, b^2, b^3, \ldots$. Our proofs utilize recent applications of bounds for linear forms in logarithms to $S$-unit equations, and consequences of the modularity of Frey-Hellegouarch curves, together with elementary arguments.
