Part of the Undergraduate Texts in Mathematics book series (UTM)
We find a formula for the number of irreducible polynomials of degree n in Fp[x] for any p and n, and use it to show that in some sense, almost every polynomial in ℤ[x] is irreducible in ℚ[x].
KeywordsMinimal Polynomial Multiplicative Function Irreducible Polynomial Monic Polynomial Chinese Remainder Theorem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 2009