In this chapter we show that every polynomial of degree >1 with coefficients in a field factors uniquely (in a sense to be defined) into a product of irreducible polynomials. To reach this result, we follow the same development as for natural numbers: the division theorem, Euclid's Algorithm and Bezout's Identity.
KeywordsCommutative Ring Unique Factorization Great Common Divisor Irreducible Polynomial Multiple Root
Unable to display preview. Download preview PDF.