Factoring Polynomial

Factoring Polynomial Other factorizations, such as square-free factorization exist, but the irreducible factorization, the most common, is the subject of this article. It depends strongly on the choice of field. For example, the fundamental theorem of algebra, which states that all polynomials with complex coefficients have complex roots, implies that a polynomial with integer coefficients can be completely reduced to linear factors over the complex field C. On the other hand, such a polynomial may only be reducible to linear and quadratic factors over the real field R. Over the rational number field Q, it is possible that no factorization at all may be possible. From a more practical vantage point, the fundamental theorem is only an existence proof, and offers little insight into the common problem of actually finding the roots of a given polynomial. It can be shown that factoring over Q (the rational numbers) can be reduced to factoring over Z (the integers).

Know More About :- How to Find Scale Factor

Tutorcircle.com

PageNo.:1/4

This is a specific example of a more general case factoring over a field of fractions can be reduced to factoring over the corresponding integral domain. This algebraic point goes by the name of Gauss's lemma. The classic proof, due to Gauss, first factors a polynomial into its content, a rational number, and its primitive part, a polynomial whose coefficients are pure integers and share no common divisor among them. Any polynomial with rational coefficients can be factored in this way, using a content composed of the greatest common divisor of the numerators, and the least common multiple of the denominators. This factorization is unique. Obtaining linear factors :- All linear factors with rational coefficients can be found using the rational root test. If the polynomial to be factored is , then all possible linear factors are of the form , where is an integer factor of and is an integer factor of . All possible combinations of integer factors can be tested for validity, and each valid one can be factored out using polynomial long division. If the original polynomial is the product of factors at least which two of which are of degree 2 or higher, this technique will only provide a partial factorization; otherwise the factorization will be complete. Note that in the case of a cubic polynomial, if the cubic is factorable at all the rational root test will give a complete factorization, either into a linear factor and an irreducible quadratic factor, or into three linear factors. Factorizing quartics :- Reducible quartic (fourth degree) polynomials with no linear factors can be factored into quadratics.

Learn More :- Imaginary Numbers Chart

Tutorcircle.com

PageNo.:2/4

Duplicate factors :- If two or more factors of a polynomial are identical to each other, a situation resulting in multiple roots, then one can exploit the fact that the duplicated factor will also be a factor of the polynomial's derivative, which itself is a polynomial of one lower degree. The duplicated factor(s) can be found by using the Euclidean algorithm to find the greatest common factor of the original polynomial and its derivative. Kronecker's method :- Since integer polynomials must factor into integer polynomial factors, and evaluating integer polynomials at integer values must produce integers, the integer values of a polynomial can be factored in only a finite number of ways, and produce only a finite number of possible polynomial factors.

Tutorcircle.com

PageNo.:3/4 PageNo.:2/3

ThankYouForWatching

Presentation