You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle
Sunil K. Chebolu and Ján Miná?
Vol. 84, No. 5 (December 2011), pp. 369-371
Published by: Mathematical Association of America
Stable URL: http://www.jstor.org/stable/10.4169/math.mag.84.5.369
Page Count: 3
Preview not available
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.
Copyright the Mathematical Association of America 2011