On the minimal number of small elements generating prime field

arXiv1703.06673MaRDI QIDQ6284537FDOQ6284537

Authors: Marc Munsch 

Publication date: 20 March 2017

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.

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Power residues, reciprocity (11A15) Finite fields and commutative rings (number-theoretic aspects) (11T99) Estimates on character sums (11L40) Applications of sieve methods (11N36)

This page was built for publication: On the minimal number of small elements generating prime field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284537)