For large primes p, the least consecutive pair of primitive roots u and u+1 (u not ±1 or a square) satisfies u ≪ O((log p)^2 (log log p)^5).
Number Theory 7 (1975), 184–188
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Least Consecutive Pair of Primitive Roots
For large primes p, the least consecutive pair of primitive roots u and u+1 (u not ±1 or a square) satisfies u ≪ O((log p)^2 (log log p)^5).