On the number of $k$th powers inside arithmetic progressions

Abstract

We find upper bounds that are sharp for the number of $k$th powers inside arbitrary arithmetic progressions whose step has $O(1)$ many divisors.

This version presents a much simpler argument and works for all powers