Recognition: unknown
On the number of kth powers inside arithmetic progressions
classification
🧮 math.NT
math.CA
keywords
arithmeticinsidenumberpowersprogressionsarbitraryboundsdivisors
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.