Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Generators and irreducible polynomials over finite fields

Author: Daqing Wan
Journal: Math. Comp. 66 (1997), 1195-1212
MSC (1991): Primary 11T24, 11T55
MathSciNet review: 1401947
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Weil's character sum estimate is used to study the problem of constructing generators for the multiplicative group of a finite field. An application to the distribution of irreducible polynomials is given, which confirms an asymptotic version of a conjecture of Hansen-Mullen.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation of the American Mathematical Society with MSC (1991): 11T24, 11T55

Retrieve articles in all journals with MSC (1991): 11T24, 11T55

Additional Information

Daqing Wan
Affiliation: Department of Mathematics, The Pennsylvania State University, University Park, Pennsylvania 16802

Received by editor(s): December 8, 1995
Received by editor(s) in revised form: May 8, 1996
Additional Notes: This research was partially supported by NSF
Article copyright: © Copyright 1997 American Mathematical Society