ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let aa be an integer with a≠−1a \neq -1 and aa not a perfect square, and write a=a0b2a = a_0 b^2 with a0a_0 squarefree and bb a positive integer. For a prime pp not dividing the numerator or denominator of aa, say that aa is a primitive root modulo pp if the residue class of aa generates the cyclic group (Z/pZ)×(\mathbb{Z}/p\mathbb{Z})^{\times}, i.e. if the multiplicative order of aa modulo pp equals p−1p-1. Put

S(a)={ p prime  :  a is a primitive root modulo p },S(a) = \{\, p \text{ prime} \;:\; a \text{ is a primitive root modulo } p \,\},

and let

CArtin=∏p prime(1−1p(p−1))=0.3739558136…C_{\mathrm{Artin}} = \prod_{p \ \mathrm{prime}} \left( 1 - \frac{1}{p(p-1)} \right) = 0.3739558136\ldots

Then the limit

δ(a)=lim⁡x→∞#{p≤x:p∈S(a)}#{p≤x:p prime}\delta(a) = \lim_{x \to \infty} \frac{\#\{ p \le x : p \in S(a) \}}{\#\{ p \le x : p \text{ prime} \}}

exists, is a positive rational multiple of CArtinC_{\mathrm{Artin}}, and in particular S(a)S(a) is infinite. Moreover, if in addition aa is not a perfect power, i.e. a≠cka \neq c^{k} for all integers cc and all integers k≥2k \ge 2, and a0≢1(mod4)a_0 \not\equiv 1 \pmod 4, then

δ(a)=CArtin.\delta(a) = C_{\mathrm{Artin}}.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.