2000 character limit reached
Arithmetic progressions among powerful numbers (2210.00281v1)
Published 1 Oct 2022 in math.NT
Abstract: In this paper, we study $k$-term arithmetic progressions $N, N+d, ..., N+(k-1)d$ of powerful numbers. Under the $abc$-conjecture, we obtain $d \gg_\epsilon N{1/2 - \epsilon}$. On the other hand, there exist infinitely many $3$-term arithmetic progressions of powerful numbers with $d \ll N{1/2}$ unconditionally. We also prove some partial results when $k \ge 4$ and pose some open questions.