ON THE MINIMAL NUMBER OF SMALL ELEMENTS GENERATING FINITE PRIME FIELDS

DOI10.1017/S000497271700048XzbMath1433.11001OpenAlexW2746680842MaRDI QIDQ5369393

Marc Munsch

Publication date: 17 October 2017

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s000497271700048x

zbMATH Keywords

finite fieldcharacter sumprimitive rootgenerating setsieve theoryalgorithmic number theory

Mathematics Subject Classification ID

Applications of sieve methods (11N36) Congruences; primitive roots; residue systems (11A07)

Cites Work

• Unnamed Item
• When the sieve works
• When the sieve works. II
• The least quadratic non residue
• Products of Small Integers in Residue Classes and Additive Properties of Fermat Quotients
• On Character Sums and Primitive Roots^†
• ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
• Searching for Primitive Roots in Finite Fields
• Upper bounds for least witnesses and generating sets
• On a Theorem of Hardy and Ramanujan
• On Minimal Sets of Generators for Primitive Roots
• Artin's Primitive Root Conjecture – A Survey
• SIEVING AND THE ERDŐS–KAC THEOREM
• On the large sieve
• The average of the least primitive root
• On Artin's conjecture.

This page was built for publication: ON THE MINIMAL NUMBER OF SMALL ELEMENTS GENERATING FINITE PRIME FIELDS