Small Prime Primitive Roots in Arithmetic Progressions
Abstract: Let $p>1$ be a large prime number, let $q=O(\log\log p)$ and let $1\leq a<q$ be a pair of relatively prime integers. It is proved that there is a prime primitive root $u\ll (\log p)(\log \log p)5$ such that $u\equiv a\bmod q$ in the prime finite field $\mathbb{F}_p$.
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.