The Burgess inequality is the best upper bound we have for incomplete character sums of Dirichlet characters. In 2006, Booker gave an explicit estimate for quadratic Dirichlet 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 10140. Both of their explicit estimates are on restricted ranges. In this paper, we prove an explicit estimate that works for any range. 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 p be to ensure that there is a kth power non-residue less than p1/6.

No abstract

No abstract

In this paper we examine Grosswald's conjecture on g(p), the least primitive root modulo p. Assuming the Generalized Riemann Hypothesis (GRH), and building on previous work by Cohen, Oliveira e Silva and Trudgian, we resolve Grosswald's conjecture by showing that g(p) < √ p − 2 for all p > 409. Our method also shows that under GRH we have ĝ(p) < √ p − 2 for all p > 2791, where ĝ(p) is the least prime primitive root modulo p.

No abstract