TOPICS
Search

Vinogradov's Least Primitive Root Conjecture


Vinogradov's least primitive root conjecture asserts that the least positive primitive root g(p) modulo a prime number p satisfies

 g(p)<<_epsilonp^epsilon
(1)

for every epsilon>0. Here the Vinogradov notation <<_epsilon means that g(p)<=C_epsilonp^epsilon for all primes p, where C_epsilon>0 is a constant that may depend on epsilon but not on p. This is stronger than the corresponding conjecture for the least quadratic nonresidue, since a primitive root modulo an odd prime is a quadratic nonresidue. Burgess (1962) proved the unconditional bound g(p)<<_epsilonp^(1/4+epsilon).

Martin (1997) used sieve methods to bound g^*(p), the least prime number that is a primitive root modulo p. His estimate depends on zero-free regions for Dirichlet L-series. Since g(p)<=g^*(p), it also bounds the least primitive root g(p).

A uniform zero-free half-plane for Dirichlet L-series implies the conjecture. Specifically, suppose that some fixed 1/2<=sigma<1 satisfies L(s,chi)!=0 for every nonprincipal number theoretic character chi and every Re[s]>sigma, independently of the modulus and height. Martin's result then gives

 g(p)<=g^*(p)<<_sigma(lnp)^(3/(1-sigma)).
(2)

Indeed, for odd p, write k=omega(p-1) for the number of distinct prime factors and c_0=phi(p-1)/(p-1), where phi is the totient function. Martin's estimate bounds g^*(p) by a constant depending only on sigma times [k^2max(1,lnk)c_0^(-1)lnp]^(1/(1-sigma)). The estimates c_0^(-1)<<max(1,lnk) and kmax(1,lnk)<<lnp bound the expression inside the power by a constant times (lnp)^3, giving the stated logarithmic bound.

OpenAI (2026) claimed the required uniform zero-free half-plane with sigma=7/8 in its proposed proof of the quasi-Riemann hypothesis. Conditional on that claim, the preceding argument yields

 g(p)<=g^*(p)<<(lnp)^(24)<<_epsilonp^epsilon.
(3)

This conditional application of Martin's bound was noted by vengy (2026). The release attributes the zero-free theorem and its Lean formalization to an internal OpenAI model. As of Oct. 25, 2026, independent specialist verification of that underlying theorem had not been reported. The implication therefore does not supply an independent unconditional proof of Vinogradov's conjecture.


See also

Primitive Root, Quasi-Riemann Hypothesis

Explore with Wolfram|Alpha

References

Burgess, D. A. "On Character Sums and L-Series." Proc. London Math. Soc. 12, 193-206, 1962. https://doi.org/10.1112/plms/s3-12.1.193.Martin, G. "The Least Prime Primitive Root and the Shifted Sieve." Acta Arith. 80, 277-288, 1997. https://doi.org/10.4064/aa-80-3-277-288.OpenAI. "The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane Re[s]>7/8." Sep. 30, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-Quasi-Riemann-Hypothesis-September-30-2026/paper.pdf.vengy. "Does OpenAI's Quasi-Riemann Hypothesis (QRH) Imply Vinogradov's Least Primitive Root Conjecture?" Mathematics Stack Exchange. Oct. 13, 2026. https://math.stackexchange.com/revisions/5151787/1.

Cite this as:

Weisstein, Eric W. "Vinogradov's Least Primitive Root Conjecture." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/VinogradovsLeastPrimitiveRootConjecture.html

Subject classifications