On the number of kth powers inside arithmetic progressions
Abstract
We find upper bounds that are sharp for the number of kth powers inside arbitrary arithmetic progressions whose step has O(1) many divisors.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.