English

Primitive Roots In Short Intervals

General Mathematics 2020-05-27 v4

Abstract

Let p2p\geq 2 be a large prime, and let N(logp)1+εN\gg ( \log p)^{1+\varepsilon}. This note proves the existence of primitive roots in the short interval [M,M+N][M,M+N], where M2M \geq 2 is a fixed number, and ε>0 \varepsilon>0 is a small number. In particular, the least primitive root g(p)=O((logp)1+ε)g(p)= O\left ((\log p)^{1+\varepsilon} \right), and the least prime primitive root g(p)=O((logp)1+ε)g^*(p)= O\left ((\log p)^{1+\varepsilon} \right) unconditionally.

Keywords

Cite

@article{arxiv.1806.01150,
  title  = {Primitive Roots In Short Intervals},
  author = {N. A. Carella},
  journal= {arXiv preprint arXiv:1806.01150},
  year   = {2020}
}

Comments

Twenty Pages. Keywords: Least primitive root, Least prime primitive root, Primitive root in short interval. arXiv admin note: substantial text overlap with arXiv:1707.06517 and text overlap with arXiv:1609.01147 and arXiv:1910.02308

R2 v1 2026-06-23T02:18:17.249Z