Artin's conjecture on primitive roots

From testwiki
Jump to navigation Jump to search

Template:About

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 2024. 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 = a0b2 with a0 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

  1. S(a) has a positive asymptotic density inside the set of primes. In particular, S(a) is infinite.
  2. Under the conditions that a is not a perfect power and a0 is not congruent to 1 modulo 4 Template:OEIS, this density is independent of a and equals Artin's constant, which can be expressed as an infinite product
    CArtin=p prime(11p(p1))=0.3739558136 Template:OEIS.

The positive integers satisfying these conditions are:

2, 3, 6, 7, 10, 11, 12, 14, 15, 18, 19, 22, 23, 24, 26, 28, 30, 31, 34, 35, 38, 39, 40, 42, 43, 44, 46, 47, 48, 50, 51, 54, 55, 56, 58, 59, 60, 62, 63, … Template:OEIS

The negative integers satisfying these conditions are:

2, 4, 5, 6, 9, 10, 13, 14, 16, 17, 18, 20, 21, 22, 24, 25, 26, 29, 30, 33, 34, 36, 37, 38, 40, 41, 42, 45, 46, 49, 50, 52, 53, 54, 56, 57, 58, 61, 62, … Template:OEIS

Similar conjectural product formulas[1] exist for the density when a does not satisfy the above conditions. In these cases, the conjectural density is always a rational multiple of CArtin. If a is a square number or a = −1, then the density is 0, and if a is a perfect pth power for prime p, then the number needs to be multiplied by p(p2)p2p1 (if there are more than one such prime p, then the number needs to be multiplied by p(p2)p2p1 for all such primes p), and if a0 is congruent to 1 mod 4, then the number needs to be multiplied by p(p1)p2p1 for all prime factors p of a0, e.g. for a = 8 = 23, the density is 35C, and for a = 5 (which is congruent to 1 mod 4), the density is 2019C.

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 CArtin. The set of such primes is Template:OEIS

S(2) = {3, 5, 11, 13, 19, 29, 37, 53, 59, 61, 67, 83, 101, 107, 131, 139, 149, 163, 173, 179, 181, 197, 211, 227, 269, 293, 317, 347, 349, 373, 379, 389, 419, 421, 443, 461, 467, 491, ...}.

It has 38 elements smaller than 500 and there are 95 primes smaller than 500. The ratio (which conjecturally tends to CArtin) 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.[2]

Without the generalized Riemann hypothesis, there is no single value of a for which Artin's conjecture is proved. D. R. Heath-Brown proved in 1986 (Corollary 1) that at least one of 2, 3, or 5 is a primitive root modulo infinitely many primes p.[3] 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 y2=x3+ax+b, Lang and Trotter gave a conjecture for rational points on E() analogous to Artin's primitive root conjecture.[4]

Specifically, they said there exists a constant CE for a given point of infinite order P in the set of rational points E() such that the number N(P) of primes (px) for which the reduction of the point P(modp) denoted by P¯ generates the whole set of points in 𝔽𝕡 in E, denoted by E¯(𝔽𝕡), is given by N(P)CE(xlogx).[5] Here we exclude the primes which divide the denominators of the coordinates of P.

Gupta and Murty proved the Lang and Trotter conjecture for E/ with complex multiplication under the Generalized Riemann Hypothesis, for primes splitting in the relevant imaginary quadratic field.[6]

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(p12j)≢1modp where j1 and j is unique and p is such that p1+2jmod2j.

The result was proven by Hasse in 1966.[4][7]

See also

References

Template:ReflistTemplate:Prime number conjectures