Papers
Topics
Authors
Recent
Search
2000 character limit reached

Least primitive root and simultaneous power-non residues

Published 18 Jan 2018 in math.NT | (1801.06110v2)

Abstract: Let $p$ be a prime and let $g(p)$ be the least primitive root modulo $p$. We prove that for any $\epsilon>0$ and $p$ large enough the bound \begin{align} g(p)\ll p{\frac{1}{4\sqrt{e}}+\epsilon} \nonumber \end{align} holds for most prime $p$ such that $p-1$ does not have small prime factors, but $2$. We also give an explicit description of the exceptional set.

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.

Authors (1)

Collections

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