Topics In Primitive Roots

Abstract

This monograph considers a few topics in the theory of primitive roots g(p) modulo a prime p>=2. A few estimates of the least primitive roots g(p) and the least prime primitive roots g^*(p) modulo p, a large prime, are determined. One of the estimate here seems to sharpen the Burgess estimate g(p) << p^(1/4+e) for arbitrarily small number 3 > 0, to the smaller estimate g(p) <= p^(5/loglog p) uniformly for all large primes p => 2. The expected order of magnitude is g(p) <<(log p)^c, c>1 constant. The corresponding estimates for least prime primitive roots g^*(p) are slightly higher. Anotrher topic deals with an effective lower bound #{p <= x : ord(g)= p-1} >> x/log x for the number of primes p <= x with a fixed primitive root g != -1, b^2 for all large number x >1. The current results in the literature claim the lower bound #{p <= x : ord(g) = p-1} >> x/(log x)^2, and have restrictions on the minimal number of fixed integers to three or more.

arXiv comment123 Pages. Improves The Proof of Theorem 12.1. Keywords: Prime Number; Primitive Root; Least Primitive Root; Least Prime Primitive Root; Artin Primitive Root Conjecture; Cyclic Group, Algebraic Subsets of Integers

References in corpus (9)

• Euler's constant: Euler's work and modern developments
• Bounded gaps between primes with a given primitive root
• Fermat quotients: Exponential sums, value set and primitive roots
• Counting numbers in multiplicative sets: Landau versus Ramanujan
• Sharp Bounds for the Harmonic Numbers
• On a Problem of Mordell with Primitive Roots
• On primes in arithmetic progression having a prescribed primitive root. II
• On the sum of digits of the factorial
• The Error Term of the Summatory Euler Phi Function