Abstract
We estimate double sums with a multiplicative character modulo where and is a subgroup of order of the multiplicative group of the finite field of elements. A nontrivial upper bound on can be derived from the Burgess bound if and from some standard elementary arguments if , where is arbitrary. We obtain a nontrivial estimate in a wider range of parameters and . We also estimate double sums and give an application to primitive roots modulo with non-zero binary digits.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.