On Character Sums and Primitive Roots†

1962 ◽  
Vol s3-12 (1) ◽  
pp. 179-192 ◽  
Author(s):  
D. A. Burgess
Author(s):  
Bo Chen

In this paper, we give an explicit upper bound on [Formula: see text], the least primitive root modulo [Formula: see text]. Since a primitive root modulo [Formula: see text] is not primitive modulo [Formula: see text] if and only if it belongs to the set of integers less than [Formula: see text] which are [Formula: see text]th power residues modulo [Formula: see text], we seek the bounds for [Formula: see text] and [Formula: see text] to find [Formula: see text] which satisfies [Formula: see text], where, [Formula: see text] denotes the number of primitive roots modulo [Formula: see text] not exceeding [Formula: see text], and [Formula: see text] denotes the number of [Formula: see text]th powers modulo [Formula: see text] not exceeding [Formula: see text]. The method we mainly use is to estimate the character sums contained in the expressions of the [Formula: see text] and [Formula: see text] above. Finally, we show that [Formula: see text] for all primes [Formula: see text]. This improves the recent result of Kerr et al.


2014 ◽  
Vol 90 (3) ◽  
pp. 376-390 ◽  
Author(s):  
MEI-CHU CHANG ◽  
IGOR E. SHPARLINSKI

AbstractWe estimate double sums $$\begin{eqnarray}S_{{\it\chi}}(a,{\mathcal{I}},{\mathcal{G}})=\mathop{\sum }\limits_{x\in {\mathcal{I}}}\mathop{\sum }\limits_{{\it\lambda}\in {\mathcal{G}}}{\it\chi}(x+a{\it\lambda}),\quad 1\leq a<p-1,\end{eqnarray}$$ with a multiplicative character ${\it\chi}$ modulo $p$ where ${\mathcal{I}}=\{1,\dots ,H\}$ and ${\mathcal{G}}$ is a subgroup of order $T$ of the multiplicative group of the finite field of $p$ elements. A nontrivial upper bound on $S_{{\it\chi}}(a,{\mathcal{I}},{\mathcal{G}})$ can be derived from the Burgess bound if $H\geq p^{1/4+{\it\varepsilon}}$ and from some standard elementary arguments if $T\geq p^{1/2+{\it\varepsilon}}$, where ${\it\varepsilon}>0$ is arbitrary. We obtain a nontrivial estimate in a wider range of parameters $H$ and $T$. We also estimate double sums $$\begin{eqnarray}T_{{\it\chi}}(a,{\mathcal{G}})=\mathop{\sum }\limits_{{\it\lambda},{\it\mu}\in {\mathcal{G}}}{\it\chi}(a+{\it\lambda}+{\it\mu}),\quad 1\leq a<p-1,\end{eqnarray}$$ and give an application to primitive roots modulo $p$ with three nonzero binary digits.


2014 ◽  
Vol 2014 ◽  
pp. 1-5
Author(s):  
Weiqiong Wang ◽  
Wenpeng Zhang

The main purpose of this paper is using the properties of Gauss sums and the estimate for character sums to study a mean value problem related to the primitive rootsmod pand the different forms of Golomb’s conjectures and propose an interesting asymptotic formula for it.


2007 ◽  
Vol 03 (04) ◽  
pp. 635-648 ◽  
Author(s):  
MIRCEA BECHEANU ◽  
FLORIAN LUCA ◽  
IGOR E. SHPARLINSKI

In this paper, we study various arithmetic properties of d + n/d, where d runs through all the τ(n) positive divisors of n. For example, denoting by ϖ(n) the number of prime values among these sums, we study how often ϖ(n) > 0 and also ϖ(n) = τ(n), and we also evaluate the average value of ϖ(n). We estimate some character sums with d + n/d and study the distribution of quadratic nonresidues and primitive roots among these sums on average over n ≤ x.


2021 ◽  
Vol 2021 ◽  
pp. 1-4
Author(s):  
Yiwei Hou ◽  
Hongyan Wang

In this paper, we use the elementary methods and the estimates for character sums to prove the following conclusion. Let p be a prime large enough. Then, for any positive integer n with p 1 / 2 + ɛ ≤ n < p , there must exist two primitive roots α and β modulo p with 1 < α , β ≤ n − 1 such that the equation n = α + β holds, where 0 < ɛ < 1 / 2 is a fixed positive number. In other words, n can be expressed as the exact sum of two primitive roots modulo p .


2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Jingzhe Wang

In this paper, we use the elementary methods and the estimates for character sums to study a problem related to primitive roots and the Pythagorean triples and prove the following result: let p be an odd prime large enough. Then, there must exist three primitive roots x ,   y , and z modulo p such that x 2 + y 2 = z 2 .


2006 ◽  
Vol 73 (3) ◽  
pp. 433-443 ◽  
Author(s):  
William D. Banks ◽  
Igor E. Shparlinski

We study multiplicative character sums taken on the values of a non-homogeneous Beatty sequence where α,β ∈ ℝ, and α is irrational. In particular, our bounds imply that for every fixed ε > 0, if p is sufficiently large and p½+ε ≤ N ≤ p, then among the first N elements of ℬα,β, there are N/2+o(N) quadratic non-residues modulo p. When more information is available about the Diophantine properties of α, then the error term o(N) admits a sharper estimate.


Sign in / Sign up

Export Citation Format

Share Document