Added to Favorites

Related Searches

Definitions

In mathematics, the Artin conjecture is a conjecture on the set of primes p modulo which a given integer a > 1 is a primitive root. The conjecture was made by Emil Artin to Helmut Hasse on September 27, 1927, according to the latter's diary.

The precise statement is as follows. Let a be an integer which is not a perfect square and not -1. Denote by S(a) the set of prime numbers p such that a is a primitive root modulo p. Then

- S(a) has a positive Schnirelmann density inside the set of primes. In particular, S(a) is infinite.
- under the condition that a be squarefree, this density is independent of a and equals the Artin constant which can be expressed as an infinite product

- $C\_\{Artin\}=prod\_\{p\; mathrm\{prime\},\; p>0\}\; left(1-frac\{1\}\{p(p-1)\}right)\; =\; 0.3739558136ldots$

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. The set of such primes is

- 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, ...}

To prove the conjecture, it is sufficient to do so for prime numbers a. In 1967, Hooley published a conditional proof for the conjecture, assuming certain cases of the Generalized Riemann hypothesis. In 1984, R. Gupta and M. Ram Murty showed unconditionally that Artin's conjecture is true for infinitely many a using sieve methods. Roger Heath-Brown improved on their result and showed unconditionally that there are at most two exceptional prime numbers a for which Artin's conjecture fails. This result is not constructive, as far as the exceptions go. For example, it follows from the theorem of Heath-Brown that one out of 3, 5, and 7 is a primitive root modulo p for infinitely many p. But the proof does not provide us with a way of computing which one. In fact, there is not a single value of a for which the Artin conjecture is known to hold.

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Monday August 25, 2008 at 21:00:09 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Monday August 25, 2008 at 21:00:09 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2015 Dictionary.com, LLC. All rights reserved.