Papers
Topics
Authors
Recent
Search
2000 character limit reached

Primitive Roots In Short Intervals

Published 1 Jun 2018 in math.GM | (1806.01150v4)

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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.