2000 character limit reached
Quadratic non-residues and non-primitive roots satisfying a coprimality condition
Published 13 Sep 2018 in math.NT | (1809.04827v1)
Abstract: Let $q\geq 1$ be any integer and let $ \epsilon \in [\frac{1}{11}, \frac{1}{2})$ be a given real number. In this short note, we prove that for all primes $p$ satisfying $$ p\equiv 1\pmod{q}, \quad \log\log p > \frac{\log 6.83}{\frac{1}{2}-\epsilon} \mbox{ and } \frac{\phi(p-1)}{p-1} \leq \frac{1}{2} - \epsilon, $$ there exists a quadratic non-residue $g$ which is not a primitive root modulo $p$ such that $gcd\left(g, \frac{p-1}{q}\right) = 1$.
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.