Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Near-primitive roots (1112.5090v1)

Published 21 Dec 2011 in math.NT

Abstract: Given an integer $t\ge 1$, a rational number $g$ and a prime $p\equiv 1({\rm mod} t)$ we say that $g$ is a near-primitive root of index $t$ if $\nu_p(g)=0$, and $g$ is of order $(p-1)/t$ modulo $p$. In the case $g$ is not minus a square we compute the density, under the Generalized Riemann Hypothesis (GRH), of such primes explicitly in the form $\rho(g)A$, with $\rho(g)$ a rational number and $A$ the Artin constant. We follow in this the approach of Wagstaff, who had dealt earlier with the case where $g$ is not minus a square. The outcome is in complete agreement with the recent determination of the density using a very different, much more algebraic, approach due to Hendrik Lenstra, the author and Peter Stevenhagen.

Summary

We haven't generated a summary for this paper yet.