Explicit Burgess Bound for Composite Moduli

Abstract

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

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…