Related papers: All Prime Numbers Have Primitive Roots

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

Let $p>2$ be prime and $g$ a primitive root modulo $p$. We present an argument for the fact that discrete logarithms of the numbers in any arithmetic progression are uniformly distributed in $[1,p]$ and raise some questions on the subject.

Let $x\geq 1$ be a large number, and let $1 \leq a <q $ be integers such that $\gcd(a,q)=1$ and $q=O(\log^c)$ with $c>0$ constant. This note proves that the counting function for the number of primes $p \in \{p=qn+a: n \geq1 \}$ with a…

Let $q\geq 1$ be any integer and let $ \epsilon \in [\frac{1}{11}, \frac{1}{2})$ be a given real number. In this short note, we prove that for all primes $p$ satisfying $$ p\equiv 1\pmod{q}, \quad \log\log p > \frac{\log…

Primitive roots of 1 mod p^k (k>2 and odd prime p) are sought, in cyclic units group G_k = A_k B_k mod p^k, coprime to p, of order (p-1)p^{k-1}. 'Core' subgroup A_k has order p-1 independent of k, and p+1 generates 'extension' subgroup B_k…

A group is called capable if it is a central factor group. For each prime $p$ and positive integer $c$, we prove the existence of a capable $p$-group of class $c$ minimally generated by an element of order $p$ and an element of order…

Given an integer $t\ge 1$, a rational number $g$ and a prime $p\equiv 1({\rm mod} t)$ we say that $g$ is a near-primitive root of index $t$ if $\nu_p(g)=0$, and $g$ is of order $(p-1)/t$ modulo $p$. In the case $g$ is not minus a square we…

Let $p$ be a prime. We prove that if a modular unit has a $p^{th}$ root that is again a modular unit then the level of that root is at most $p$ times the level of the original unit.

D.H. Lehmer found a quadratic polynomial such that 326 is a primitive root for the first 206 primes represented by this polynomial. It is shown that this is related to the class number one problem and prime producing quadratics. An…

For every prime $p$, we construct an infinite countable group that contains precisely $p-1$ elements which are not $p$th powers.

We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.

Let $p>1$ be a large prime number and let $x=O((\log p)^2(\log\log p)^5$ be a real number. It is proved that the least consecutive pair of primitive roots $u\ne\pm1, v^2$ and $u+1$ satisfies the upper bound $u\ll x$ in the prime field…

Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p=a(mod f) and g is a primitive root modulo p has a…

We study the difference between the number of primitive roots modulo $p$ and modulo $p+k$ for prime pairs $p,p+k$. Assuming the Bateman-Horn conjecture, we prove the existence of strong sign biases for such pairs. More importantly, we prove…

In 1927, E. Artin conjectured that all non-square integers $a\neq -1$ are a primitive root of $\mathbb{F}_p$ for infinitely many primes $p$. In 1967, Hooley showed that this conjecture follows from the Generalized Riemann Hypothesis (GRH).…

We give several characterizations of Mersenne primes (Theorem 1.1) and of primes for which 2 is a primitive root (Theorem 1.2). These characterizations involve group algebras, circulant matrices, binomial coefficients, and bipartite graphs.

Let p1, p2,..., pn be distinct prime numbers, and let Nn be their product. We prove that, for any positive integer L that is divisible by the least common multiple of p1 minus one, p2 minus one, and so on, and for integers a1, a2,..., an…

The celebrated Artin conjecture on primitive roots asserts that given any integer $g$ which is neither $-1$ nor a perfect square, there is an explicit constant $A(g)>0$ such that the number $\Pi(x;g)$ of primes $p\le x$ for which $g$ is a…

We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…