Jump to content

Artin's conjecture on primitive roots: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
No edit summary
Tags: Mobile edit Mobile web edit
m Reverted edits by 185.104.138.51 (talk): not providing a reliable source (WP:CITE, WP:RS) (HG) (3.4.12)
 
(63 intermediate revisions by 38 users not shown)
Line 1: Line 1:
{{dablink|This page discusses a conjecture of Emil Artin on primitive roots. For the conjecture of Artin on L-functions, see [[Artin L-function]].}}
{{About|the conjecture of Emil Artin on primitive roots|the conjecture of Artin on L-functions|Artin L-function}}


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 n|primitive root]] modulo infinitely many [[prime number|primes]] ''p''. The [[conjecture]] also ascribes an [[asymptotic density]] to these primes. This conjectural density equals Artin's constant or a [[rational number|rational]] multiple thereof.
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 n|primitive root]] modulo infinitely many [[prime number|primes]] ''p''. The [[conjecture]] also ascribes an [[asymptotic density]] to these primes. This conjectural density equals Artin's constant or a [[rational number|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 2023. In fact, there is no single value of ''a'' for which Artin's conjecture is proved.
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==
==Formulation==
Line 31: Line 31:
In 1967, [[Christopher Hooley]] published a [[conditional proof]] for the conjecture, assuming certain cases of the [[generalized Riemann hypothesis]].<ref>{{cite journal |last1=Hooley|first1=Christopher |year=1967 |title=On Artin's conjecture |journal=J. Reine Angew. Math. |volume=1967 |issue=225 |pages=209–220|mr=0207630|doi=10.1515/crll.1967.225.209|s2cid=117943829 }}</ref>
In 1967, [[Christopher Hooley]] published a [[conditional proof]] for the conjecture, assuming certain cases of the [[generalized Riemann hypothesis]].<ref>{{cite journal |last1=Hooley|first1=Christopher |year=1967 |title=On Artin's conjecture |journal=J. Reine Angew. Math. |volume=1967 |issue=225 |pages=209–220|mr=0207630|doi=10.1515/crll.1967.225.209|s2cid=117943829 }}</ref>


Without the generalized Riemann hypothesis, there is no single value of ''a'' for which Artin's conjecture is proved. [[Roger Heath-Brown|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''.<ref>{{ cite journal |author=D. R. Heath-Brown |title=Artin's Conjecture for Primitive Roots |journal=The Quarterly Journal of Mathematics |volume=37 |issue=1 |date=March 1986 |pages=27–38 |doi=10.1093/qmath/37.1.27}}</ref> He also proved (Corollary 2) that there are at most two primes for which Artin's conjecture fails.
Without the generalized Riemann hypothesis, there is no single value of ''a'' for which Artin's conjecture is proved. [[Roger Heath-Brown|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''.<ref>{{ cite journal |author=D. R. Heath-Brown |title=Artin's Conjecture for Primitive Roots |journal=The Quarterly Journal of Mathematics |volume=37 |issue=1 |date=March 1986 |pages=27–38 |doi=10.1093/qmath/37.1.27}}</ref> He also proved (Corollary 2) that there are at most two primes for which Artin's conjecture fails.


== Some Variations of Artin's Problem. ==
== Some variations of Artin's problem ==


=== Elliptic Curve ===
=== Elliptic curve ===
An elliptic curve <math>E</math> given by <math>y^2 = x^3+ax+b</math>, Lang and Trotter gave a conjecture for rational points on <math>E/(\mathbb{F_p})</math> analogous to Artin's primitive root conjecture.<ref name=":0">{{Cite document |last=MOREE |first=PIETER |title=ARTIN'S PRIMITIVE ROOT CONJECTURE- a survey |url=http://guests.mpim-bonn.mpg.de/moree/surva.pdf}}</ref>
An elliptic curve <math>E</math> given by <math>y^2 = x^3+ax+b</math>, Lang and Trotter gave a conjecture for rational points on <math>E(\mathbb{Q})</math> analogous to Artin's primitive root conjecture.<ref name=":0">{{Cite web |last=Moree |first=Pieter |title=Artin's Primitive Root Conjecture a survey |url=http://guests.mpim-bonn.mpg.de/moree/surva.pdf}}</ref>


Specifically, they said there exists a constant <math>C_E</math> for a given point of infinite order <math>P</math> in the set of rational points <math>E(\mathbb{Q})</math> such that the number <math>N(P)</math> of primes (<math>p\leq x</math>) for which the reduction of the point <math>P\pmod p</math> denoted by <math>\bar{P}</math> generates the whole set of points in <math>\mathbb{F_p}</math> in <math>E</math>, denoted by <math>\bar{E}(\mathbb{F_p})</math>. Here we exclude the primes which divide the denominators of the coordinates of <math>P</math>.
Specifically, they said there exists a constant <math>C_E</math> for a given point of infinite order <math>P</math> in the set of rational points <math>E(\mathbb{Q})</math> such that the number <math>N(P)</math> of primes (<math>p\leq x</math>) for which the reduction of the point <math>P\pmod p</math> denoted by <math>\bar{P}</math> generates the whole set of points in <math>\mathbb{F_p}</math> in <math>E</math>, denoted by <math>\bar{E}(\mathbb{F_p})</math>, is given by <math>N(P)\sim C_E\left ( \frac{x}{\log x} \right )</math>.<ref>{{Cite journal |last=Lang and 2 Trotter |date=1977 |title=Primitive points on Elliptic Curves |journal=Bull. Amer. Math. Soc. |volume=83 |issue=2 |pages=289–292|doi=10.1090/S0002-9904-1977-14310-3 |doi-access=free |url=https://projecteuclid.org/journals/bulletin-of-the-american-mathematical-society/volume-83/issue-2/Primitive-points-on-elliptic-curves/bams/1183538693.pdf }}</ref> Here we exclude the primes which divide the denominators of the coordinates of <math>P</math>.


Moreover, Lang and Trotter conjectured that <math>N(P)</math> ~ <math>C_E\left ( \frac{x}{log x} \right )</math>.<ref>{{Cite journal |last=Lang and 2 Trotter |date=1977 |title=Primitive points on Elliptic Curves |journal=Bull. Amer. Math. Soc. |volume=83 |issue=2 |pages=289–292|doi=10.1090/S0002-9904-1977-14310-3 }}</ref> Gupta and Murty proved the Larry and Trotter conjecture for <math>E/\mathbb{Q}</math> with complex multiplication under the Generalized Reimann Hypothesis<ref>{{Cite journal |last=Gupta and Murty |date=1987 |title=Primitive points on elliptic curves |url=https://eudml.org/doc/89763 |journal=Compositio Mathematica |volume=58 |pages=13–44}}</ref>
Gupta and Murty proved the Lang and Trotter conjecture for <math>E/\mathbb{Q}</math> with complex multiplication under the Generalized Riemann Hypothesis, for primes splitting in the relevant imaginary quadratic field.<ref>{{Cite journal |last=Gupta and Murty |date=1987 |title=Primitive points on elliptic curves |url=https://eudml.org/doc/89763 |journal=Compositio Mathematica |volume=58 |pages=13–44}}</ref>


=== Even Order ===
=== Even order ===
Krishnamurty proposed the question how often the period of the decimal expansion <math>1/p</math> of a prime <math>p</math> is even.
Krishnamurty proposed the question how often the period of the decimal expansion <math>1/p</math> of a prime <math>p</math> is even.



Latest revision as of 20:06, 26 September 2024

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

[edit]

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 that a0 is not congruent to 1 modulo 4 (sequence A085397 in the OEIS), this density is independent of a and equals Artin's constant, which can be expressed as an infinite product
    (sequence A005596 in the 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.

Example

[edit]

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 (sequence A001122 in the 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

[edit]

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

[edit]

Elliptic curve

[edit]

An elliptic curve given by , Lang and Trotter gave a conjecture for rational points on analogous to Artin's primitive root conjecture.[4]

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

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

Even order

[edit]

Krishnamurty proposed the question how often the period of the decimal expansion of a prime is even.

The claim is that the period of the decimal expansion of a prime in base is even if and only if where and is unique and p is such that .

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

See also

[edit]

References

[edit]
  1. ^ Michon, Gerard P. (2006-06-15). "Artin's Constant". Numericana.
  2. ^ Hooley, Christopher (1967). "On Artin's conjecture". J. Reine Angew. Math. 1967 (225): 209–220. doi:10.1515/crll.1967.225.209. MR 0207630. S2CID 117943829.
  3. ^ D. R. Heath-Brown (March 1986). "Artin's Conjecture for Primitive Roots". The Quarterly Journal of Mathematics. 37 (1): 27–38. doi:10.1093/qmath/37.1.27.
  4. ^ a b Moree, Pieter. "Artin's Primitive Root Conjecture – a survey" (PDF).
  5. ^ Lang and 2 Trotter (1977). "Primitive points on Elliptic Curves" (PDF). Bull. Amer. Math. Soc. 83 (2): 289–292. doi:10.1090/S0002-9904-1977-14310-3.{{cite journal}}: CS1 maint: numeric names: authors list (link)
  6. ^ Gupta and Murty (1987). "Primitive points on elliptic curves". Compositio Mathematica. 58: 13–44.
  7. ^ Hasse, H (1966). "About the density of prime numbers p, for a given integral number a not equal to 0 of even or odd order mod p". Mathematische Annalen: 19–23. doi:10.1007/BF01361432. S2CID 121171472.