factorization of primitive polynomial
As an application of the parent entry (http://planetmath.org/EliminationOfUnknown) we take the factorization of a primitive polynomial of into primitive (http://planetmath.org/PrimitivePolynomial) prime factors
. We shall see that the procedure may be done by performing a finite number of tests.
Let
be a primitive polynomial in .
By the rational root theorem and the factor theorem, one finds all first-degree prime factors and thus all primitive prime factors of the polynomial .
If has a primitive quadratic factor, then it has also a factor
(1) |
where and are rationals (and conversely). For settling the existence of such a factor we treat and as unknowns and perform the long division
It gives finally the remainder where and belong to . According to the parent entry (http://planetmath.org/EliminationOfUnknown) we bring the system
to the form
and then can determine the possible rational solutions of the system via a finite number of tests. Hencewe find the possible quadratic factors (1) having rational coefficients. Such a factor is converted into a primitive one when it is multiplied by the gcd of the denominators of and .
Determining a possible cubic factor with rational coefficients requires examination of a remainder of the form
In the needed system
we have to perform two eliminations. Then we can act as above and find a primitive cubic factor of . Similarly also the primitive factors of higher degree. All in all, one needs only look for factors of degree .
References
- 1 K. Väisälä: Lukuteorian ja korkeamman algebran alkeet. Tiedekirjasto No. 17. Kustannusosakeyhtiö Otava, Helsinki (1950).