arXiv · 1806.01150
Primitive Roots In Short Intervals
Abstract
Let $p\geq 2$ be a large prime, and let $N\gg ( \log p)^{1+\varepsilon}$. This note proves the existence of primitive roots in the short interval $[M,M+N]$, where $M \geq 2$ is a fixed number, and $ \varepsilon>0$ is a small number. In particular, the least primitive root $g(p)= O\left ((\log p)^{1+\varepsilon} \right)$, and the least prime primitive root $g^*(p)= O\left ((\log p)^{1+\varepsilon} \right)$ unconditionally.
Explore related subjects
Keep this discovery
N. A. Carella. 2018-06-01. Primitive Roots In Short Intervals. https://arxiv.org/abs/1806.01150
Cite the original work for its findings. Save a collection to share your selection of sources.