𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Sunil K. Chebolu and Ján Mináč


Book ID
115473361
Publisher
Mathematical Association of America
Year
2011
Tongue
English
Weight
215 KB
Volume
84
Category
Article
ISSN
0025-570X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Counting irreducible factors of polynomi
✍ Arnold Knopfmacher; John Knopfmacher 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 728 KB

Counting irreducible factors of polynomials over a finite field, Discrete Mathematics, 112 (1993) 103-l 18. Let F,[X] denote a polynomial ring in an indeterminate X over a finite field IF,. Exact formulae are derived for (i) the number of polynomials of degree n in F,[X] with a specified number of i