# Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle

@article{Chebolu2010CountingIP, title={Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle}, author={Sunil K. Chebolu and J. Min{\'a}c}, journal={Mathematics Magazine}, year={2010}, volume={84}, pages={369 - 371} }

Summary C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Using just very basic knowledge of finite fields and the inclusion-exclusion formula, we show how one can see the shape of this formula and its proof almost instantly.

#### 19 Citations

Visibly Irreducible Polynomials over Finite Fields

- Mathematics, Computer Science
- Am. Math. Mon.
- 2020

Counting Irreducible Polynomials of Degree over and Generating Goppa Codes Using the Lattice of Subfields of

- Mathematics
- 2014

Number of irreducible polynomials whose compositions with monic monomials have large irreducible factors

- Mathematics
- 2019

An Algorithm to Find the Irreducible Polynomials Over Galois Field GF(pm)

- Computer Science
- 2015

Uniform probability and natural density of mutually left coprime polynomial matrices over finite fields

- Mathematics
- 2017

A new lower bound on the family complexity of Legendre sequences

- Mathematics
- Applicable Algebra in Engineering, Communication and Computing
- 2020

#### References

SHOWING 1-9 OF 9 REFERENCES

A classical introduction to modern number theory

- Mathematics, Computer Science
- Graduate texts in mathematics
- 1982

Abstract algebra, third edition

- 2004

and R

- M. Foote, Abstract Algebra, 3rd ed., John Wiley, Hoboken, NJ,
- 2004

and M

- Rosen, A Classical Introduction to Modern Number Theory, 2nd ed., Springer-Verlag, New York,
- 1990

Untersuchungen Über Höhere Arithmetik, 2nd ed., reprinted, Chelsea

- New York,
- 1981

Untersuchungen Über Höhere Arithmetik, second edition, reprinted

- Chelsea publishing company,
- 1981

Using just very basic knowledge of finite fields and the inclusion-exclusion formula, we show how one can see the shape of this formula and its proof almost instantly