Artin Constant

In number theory, Artin's conjecture on primitive roots states that a given integer ''a'' that is neither a square number nor −1 is a primitive root modulo infinitely many primes ''p''. The conjecture also ascribes an asymptotic density to these primes. This conjectural density equals Artin's constant or a rational multiple thereof.

The conjecture was made by Emil Artin to Helmut Hasse on September 27, 1927, according to the latter's diary. The conjecture is still unresolved as of 2022. In fact, there is no single value of ''a'' for which Artin's conjecture is proved.

Formulation

Let ''a'' be an integer that is not a square number and not −1. Write ''a'' = ''a''₀''b''² with ''a''₀ square-free. Denote by ''S''(''a'') the set of prime numbers ''p'' such that ''a'' is a primitive root modulo ''p''. Then the conjecture states
# ''S''(''a'') has a positive asymptotic density inside the set of primes. In particular, ''S''(''a'') is infinite.
# Under the conditions that ''a'' is not a perfect power and that ''a''₀ is not congruent to 1 modulo 4 , this density is independent of ''a'' and equals Artin's constant, which can be expressed as an infinite product
#: $C_=\prod_ \left(1-\frac\right) = 0.3739558136\ldots$ .

Similar conjectural product formulas exist for the density when ''a'' does not satisfy the above conditions. In these cases, the conjectural density is always a rational multiple of ''C''_Artin.

Example

For example, take ''a'' = 2. The conjecture claims that the set of primes ''p'' for which 2 is a primitive root has the above density ''C''_Artin. The set of such primes is
: ''S''(2) = .
It has 38 elements smaller than 500 and there are 95 primes smaller than 500. The ratio (which conjecturally tends to ''C''_Artin) is 38/95 = 2/5 = 0.4.

Partial results

In 1967, Christopher Hooley published a conditional proof for the conjecture, assuming certain cases of the generalized Riemann hypothesis.

Without the generalized Riemann hypothesis, there is no single value of ''a'' for which Artin's conjecture is proved. D. R. Heath-Brown proved (Corollary 1) that at least one of 2, 3, or 5 is a primitive root modulo infinitely many primes ''p''. He also proved (Corollary 2) that there are at most two primes for which Artin's conjecture fails.

Some Variations of Artin's Problem.

Elliptic Curve

An elliptic curve $E$ given by $y^2 = x^3+ax+b$, Lang and Trotter gave a conjecture for rational points on $E/(\mathbb)$ analogous to Artin's primitive root conjecture.

Specifically, they said there exists a constant $C_E$ for a given point of infinite order $P$ in the set of rational points $E(\mathbb)$ such that the number $N(P)$ of primes ($p\leq x$) for which the reduction of the point $P\pmod p$ denoted by $\bar$ generates the whole set of points in $\mathbb$ in $E$, denoted by $\bar(\mathbb)$. Here we exclude the primes which divide the denominators of the coordinates of $P$.

Moreover, Lang and Trotter conjectured that $N(P)$ ~ $C_E\left ( \frac \right )$. Gupta and Murty proved the Larry and Trotter conjecture for $E/\mathbb$ with complex multiplication under the Generalized Reimann Hypothesis

Even Order

Krishnamurty proposed the question how often the period of the decimal expansion $1/p$ of a prime $p$ is even.

The claim is that the period of the decimal expansion of a prime in base $g$ is even if and only if $g^\left ( \frac \right )\not\equiv1\bmod p$ where $j\geq1$ and $j$ is unique and p is such that $p\equiv 1+2^j\mod$.

The result was proven by Hasse in 1966.

See also

*Stephens' constant, a number that plays the same role in a generalization of Artin's conjecture as Artin's constant plays here
* Brown–Zassenhaus conjecture
*Full reptend prime
*Cyclic number (group theory)

References

{{Prime number conjectures

Analytic number theory
Algebraic number theory
Conjectures about prime numbers
Unsolved problems in number theory