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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.