Primitive Roots In Short Intervals

preprint2020arXivOpen access

Abstract

Let p≥2p\geq 2 be a large prime, and let N≫(log⁡p)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 M≥2M \geq 2 is a fixed number, and ε>0 \varepsilon>0 is a small number. In particular, the least primitive root g(p)=O((log⁡p)1+ε)g(p)= O\left ((\log p)^{1+\varepsilon} \right), and the least prime primitive root g∗(p)=O((log⁡p)1+ε)g^*(p)= O\left ((\log p)^{1+\varepsilon} \right) unconditionally.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.