On the minimal number of small elements generating prime field
classification
🧮 math.NT
keywords
elementsfieldnumberprimeboundepsilonfinitegenerate
read the original abstract
In this note, we give an upper bound for the number of elements from the interval $[1,p^{1/4e^{1/2}+\epsilon}]$ necessary to generate the finite field $\mathbb{F}_{p}$ with $p$ an odd prime.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.