Papers
Topics
Authors
Recent
Search
2000 character limit reached

Explicit Burgess Bound for Composite Moduli

Published 19 Oct 2020 in math.NT | (2010.09530v2)

Abstract: We prove an explicit version of Burgess' bound on character sums for composite moduli.

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

Collections

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

Sign Up