Factoring in ℤ[x]

Part of the Undergraduate Texts in Mathematics book series (UTM)

In Section 17D we showed that if f(x) is a polynomial with coefficients in ℤ, then one can determine in a finite number of steps the complete factorization of f(x) into a product of irreducible polynomials in ℚ[x]. The method, Lagrange interpolation, is quite slow in practice.

In this chapter, we'll give another proof of the finiteness of the process of factoring, and then describe some refinements of the proof that speed up the process.


Null Space Great Common Divisor Irreducible Polynomial Monic Polynomial Irreducible Factor 
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.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Personalised recommendations