Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Finite sets containing near-primitive roots (2006.15200v1)

Published 26 Jun 2020 in math.NT

Abstract: Fix $a \in \mathbb{Z}$, $a\notin {0,\pm 1}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p{\frac12-\epsilon}$. It is an open problem to show the same result with $\frac12$ replaced by any larger constant. We show that if $a,b$ are multiplicatively independent, then for almost all primes $p$, one of $a,b,ab, a2b, ab2$ has order exceeding $p{\frac{1}{2}+\frac{1}{30}}$. The same method allows one to produce, for each $\epsilon > 0$, explicit finite sets $\mathcal{A}$ with the property that for almost all primes $p$, some element of $\mathcal{A}$ has order exceeding $p{1-\epsilon}$. Similar results hold for orders modulo general integers $n$ rather than primes $p$.

Summary

We haven't generated a summary for this paper yet.