Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 29 Nov 2018 in math.NT and math.CA | (1811.11919v2)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Jean Bourgain 
  2. Ciprian Demeter 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up