The Burgess inequality and the least k-th power non-residue

preprint2015arXivOpen access

Abstract

The Burgess inequality is the best upper bound we have for the character sum Sχ(M,N)=∑M<n≤M+Nχ(n).S_χ(M,N) = \sum_{M<n\le M+N} χ(n). Until recently, no explicit estimates had been given for the inequality. In 2006, Booker gave an explicit estimate for quadratic characters which he used to calculate the class number of a 32-digit discriminant. McGown used an explicit estimate to show that there are no norm-Euclidean Galois cubic fields with discriminant greater than 1014010^{140}. Both of their explicit estimates are on restricted ranges. In this paper we prove an explicit estimate that works for any MM and NN. We also improve McGown's estimates in a slightly narrower range, getting explicit estimates for characters of any order. We apply the estimates to the question of how large must a prime pp be to ensure that there is a kk-th power non-residue less than p1/6p^{1/6}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.