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