Factoring in Fp[x] and in ℤ[x]

  • Lindsay N. Childs
Part of the Undergraduate Texts in Mathematics book series (UTM)


We describe methods for factoring polynomials over F p = ℤ/pℤ and over ℤ. In the first section we present Berlekamp’s algorithm for factoring a polynomial over ℤ/pℤ. In subsequent sections we show how to lift such a factorization to one over ℤ/p2ℤ, then over ℤ/p4ℤ, etc., and eventually to a unique possible factorization over ℤ.


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 Science+Business Media New York 1995

Authors and Affiliations

  • Lindsay N. Childs
    • 1
  1. 1.Department of MathematicsSUNY at AlbanyAlbanyUSA

Personalised recommendations