Skip to main content
Log in

Counting irreducible polynomials over finite fields

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

Abstract

In this paper we generalize the method used to prove the Prime Number Theorem to deal with finite fields, and prove the following theorem:

$$ \pi (x) = \frac{q} {{q - 1}}\frac{x} {{\log _q x}} + \frac{q} {{(q - 1)^2 }}\frac{x} {{\log _q^2 x}} + O\left( {\frac{x} {{\log _q^3 x}}} \right),x = q^n \to \infty $$

where π(x) denotes the number of monic irreducible polynomials in F q [t] with norm ⩽ x.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M. Kruse, H. Stichtenoth: Ein Analogon zum Primzahlsatz fur algebraische Functionenkoper. Manuscripta Math. 69 (1990), 219–221. (In German.)

    Article  MATH  MathSciNet  Google Scholar 

  2. H. Davenport: Multiplicative Number Theory. Springer-Verlag, New York, 1980.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qichun Wang.

Additional information

The work is supported by Grants with No. 60772131, NCET08, and the Ph.D. Programs Foundation of Ministry of Education of China 2009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Q., Kan, H. Counting irreducible polynomials over finite fields. Czech Math J 60, 881–886 (2010). https://doi.org/10.1007/s10587-010-0055-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10587-010-0055-x

Keywords

MSC 2010

Navigation