# Factorization

This article needs additional citations for verification. (December 2011) |

In mathematics, **factorization** (*also* **factorisation** *in British English*) or **factoring** is the decomposition of an object (for example, a number, a polynomial, or a matrix) into a product of other objects, or *factors*, which when multiplied together give the original. For example, the number 15 factors into primes as 3 × 5, and the polynomial *x*^{2} − 4 factors as (*x* − 2)(*x* + 2). In all cases, a product of simpler objects is obtained.

The aim of factoring is usually to reduce something to “basic building blocks”, such as numbers to prime numbers, or polynomials to irreducible polynomials. Factoring integers is covered by the fundamental theorem of arithmetic and factoring polynomials by the fundamental theorem of algebra. Viète's formulas relate the coefficients of a polynomial to its roots.

The opposite of polynomial factorization is expansion, the multiplying together of polynomial factors to an “expanded” polynomial, written as just a sum of terms.

Integer factorization for large integers appears to be a difficult problem. There is no known method to carry it out quickly. Its complexity is the basis of the assumed security of some public key cryptography algorithms, such as RSA.

A matrix can also be factorized into a product of matrices of special types, for an application in which that form is convenient. One major example of this uses an orthogonal or unitary matrix, and a triangular matrix. There are different types: QR decomposition, *LQ*, *QL*, *RQ*, *RZ*.

Another example is the factorization of a function as the composition of other functions having certain properties; for example, every function can be viewed as the composition of a surjective function with an injective function. This situation is generalized by factorization systems.

## Contents

## Integers

By the fundamental theorem of arithmetic, every positive integer greater than 1 has a unique prime factorization. Given an algorithm for integer factorization, one can factor any integer down to its constituent primes by repeated application of this algorithm.^{1} For very large numbers, no efficient algorithm is known.

## Polynomials

### Quadratic polynomials

Any quadratic polynomial over the complex numbers (polynomials of the form where , , and ∈ ) can be factored into an expression with the form using the quadratic formula. The method is as follows:

where and are the two roots of the polynomial, found with the quadratic formula.

#### Polynomials factorable over the integers

Quadratic polynomials can sometimes be factored into two binomials with simple integer coefficients by use of Vieta's formulas, without the need to use the quadratic formula. In a quadratic equation, this will expose its two roots. The formula

would be factored into:

where

and

Each binomial can then be set equal to zero, and solving for *x* reveals the two roots.

Consider for example 2*x*^{2} − 5*x* + 2 = 0. Because *a* = 2 and *mn* = *a*, *mn* = 2, which means that of *m* and *n*, one is 1 and the other is 2. Now we have (2*x* + *p*)(*x* + *q*) = 0. Because *c* = 2 and *pq* = c, *pq* = 2, which means that of *p* and *q*, one is 1 and the other is 2 or one is −1 and the other is −2. A guess and check of substituting the 1 and 2, and −1 and −2, into *p* and *q* (while applying *pn* + *mq* = *b*) tells us that 2*x*^{2} − 5*x* + 2 = 0 factors into (2*x* − 1)(*x* − 2) = 0, giving us the roots *x* = {0.5, 2}.

**Note:** A quick way to check whether the second term in the binomial should be positive or negative (in the example, 1 and 2 and −1 and −2) is to check the second operation in the trinomial (+ or −). If it is +, then check the first operation: if it is +, the terms will be positive, while if it is −, the terms will be negative. If the second operation is −, there will be one positive and one negative term; guess and check is the only way to determine which one is positive and which is negative.

If a polynomial with integer coefficients has a discriminant that is a perfect square, that polynomial is factorable over the integers. For example, consider the polynomial 2*x*^{2} + 2*x* − 12. If the values of the expression are substituted into the quadratic formula, the discriminant *b*^{2} − 4*ac* becomes 2^{2} − (4 × 2 × (−12)), which equals 100. 100 is a perfect square, so the polynomial 2*x*^{2} + 2*x* − 12 is factorable over the integers; its factors are 2, (*x* − 2), and (*x* + 3).

Now consider the polynomial *x*^{2} + 93*x* − 2. Its discriminant, 93^{2} − 4 × 1 × (−2), is equal to 8657, which is not a perfect square. So *x*^{2} + 93*x* − 2 cannot be factored over the integers.

#### Perfect square trinomials

Some quadratics can be factored into two identical binomials. These quadratics are called perfect square trinomials. Perfect square trinomials can be factored as follows:

and

#### Sum/difference of two squares

Another common type of algebraic factoring is called the difference of two squares. It is the application of the formula

to any two terms, whether or not they are perfect squares. If the two terms are subtracted, simply apply the formula. If they are added, the two binomials obtained from the factoring will each have an imaginary term. This formula can be represented as

For example, can be factored into .

#### Factoring by grouping

Another way to factor some polynomials is factoring by grouping. For those who like algorithms, “factoring by grouping” may be the best way to approach factoring a trinomial, as it takes the guess work out of the process.

Factoring by grouping is done by placing the terms in the polynomial into two or more groups, where each group can be factored by a known method. The results of these factorizations can sometimes be combined to make an even more simplified expression. For example, to factor the polynomial

Group similar terms,

Factor out greatest common factor,

Factor out binomial

#### AC Method

If a quadratic polynomial has rational solutions, we can find p and q so that pq = ac and p + q = b. (If the discriminant is a square number these exist, otherwise we have irrational or complex solutions, and the assumption of rational solutions is not valid.)

The terms on top will have common factors that can be factored out and used to cancel the denominator, if it is not 1. As an example consider the quadratic polynomial:

Inspection of the factors of ac = 36 leads to 4 + 9 = 13 = b.

### Factoring other polynomials

#### Sum/difference of two cubes

Another formula for factoring is the sum or difference of two cubes. The sum can be represented by

and the difference by

#### Difference of two fourth powers

Another formula is the difference of two fourth powers, which is

- This formula is derivable from the difference-of-two-squares formula by treating
*a*^{4}and*b*^{4}as the squares of*a*^{2}and*b*^{2}, respectively; applying the difference-of-two squares formula in factoring (*a*^{4}-*b*^{4}) into (*a*^{2}+*b*^{2}·*a*^{2}-*b*^{2}); and reapplying the difference-of-two-squares formula to the second factor, thereby restating the overall expression as (*a*^{2}+*b*^{2}·*a*+*b*·*a*-*b*).

#### Sum/difference of two fifth powers

Another formula for factoring is the sum or difference of two fifth powers. The sum can be represented by

and the difference by

(Both of these can be factored further, but not with integer coefficients.)

#### Sum/difference of two sixth powers

Then there's the formula for factoring the sum or difference of two sixth powers. The sum can be represented by

and the difference by

#### Sum/difference of two seventh powers

And lastly there’s the formula for factoring the sum or difference of two seventh powers. The sum can be represented by

and the difference by

#### Sum/difference of two n^{th} powers

The above factorization of differences of powers can be extended to any positive integer power *n* by use of the geometric series. By noting that

and multiplying by the (*x* − 1) factor, the desired result is found. To give the general form as above, we can replace *x* by *a/b* and multiply both sides by *b*^{n}. This gives the general form for the difference of two *n*^{th} powers as

The corresponding sum of two *n*^{th} powers depends on whether *n* is even or odd. If *n* is odd, *b* can be replaced by −*b* in the above formula, to give

If *n* is even, we consider two cases:

1. If n is a power of 2

is unfactorable.

2.Let *n* equal

where m is odd.

Then, the expression can be written

Now, the general factorization is

#### Other factorization formulae

## Matrices

## Euclidean domains

This section is empty. You can help by adding to it. (January 2012) |

## See also

- Completing the square
- Factorization of polynomials
- Factor theorem
- FOIL rule
- Monoid factorisation
- Pascal's triangle
- Prime factor
- Fermat's factorization method
- Euler's factorization method
- Integer factorization
- Multiplicative partition
- Partition (number theory) - A way of writing a number as a sum of positive integers.
- Program synthesis
- Table of Gaussian integer factorizations
- Unique factorization

## References

**^**Hardy; Wright (1980).*An Introduction to the Theory of Numbers*(5th ed.). Oxford Science Publications. ISBN 978-0198531715.

## External links

Look up or factorisation in Wiktionary, the free dictionary.factorization |

- Hazewinkel, Michiel, ed. (2001), "Factorization of polynomials",
*Encyclopedia of Mathematics*, Springer, ISBN 978-1-55608-010-4 - One hundred million numbers factored on html pages.
- A page about factorization, Algebra, Factoring
- WIMS Factoris is an online factorization tool.
- Wolfram Alpha can factorize too.

HPTS - Area Progetti - Edu-Soft - JavaEdu - N.Saperi - Ass.Scuola.. - TS BCTV - TS VideoRes - TSODP - TRTWE | ||