In mathematics, factorization 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 x2 − 4 factors as (x − 2)(x + 2). In all cases, we obtain a product of simpler things.
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.
The opposite of factorization is expansion. This is the process of multiplying together factors to recreate the original, "expanded" polynomial.
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.
Any quadratic polynomial (polynomials in the form of ) can be factored into an expression with the form using the quadratic formula. The method is as follows:
Quadratic polynomials can sometimes be factored into two binomials with simple integer coefficients, without the need to use the quadratic formula. In a quadratic equation, this will expose its two roots. The formula
would be factored into:
You can then set each binomial equal to zero, and solve for x to reveal the two roots. Factoring does not involve any other formulas, and is mostly just something you see when you come upon a quadratic equation.
Take for example 2x2 − 5x + 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 (2x + 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 2x2 − 5x + 2 = 0 factors into (2x − 1)(x − 2) = 0, giving us the roots x = {1⁄2, 2}
The table method is less used method that involves creating a multiplication table. This method is very decisive and can be much faster than other algorithms once the rules surrounding the method are mastered.
To factor the polynomial ax2 + bx + c:
The table will then be in this form:
| a | j | A = GCF(a,j) | |
| k | c | B = GCF(k,c) | |
| C = GCF(a,k) | D = GCF(j,c) |
The GCFs comprise the final factors of the quadratic in this way:
In the table, place the a value in the top-left and the last term (c) in the bottom-right box. Fit the -9 and -8 in the remaining boxes. Then find the GCF up and down and side to side for each row for the answer.
| 6 | -8 | 2 | |
| -9 | 12 | 3 | |
| 3 | 4 |
The final answer is (3x − 4)(2x − 3).
Another common type of algebraic factoring is called the difference of two squares. It is the application of the formula
For example, can be factored into .
In general, the difference of any two numbers raised to the same (positive integer) power
For example, suppose you had the expression
By the fundamental theorem of arithmetic, every positive integer 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. For very large numbers, no efficient algorithm is known. For smaller numbers, however, there are a variety of different algorithms that can be applied.
In mathematical logic and automated theorem proving, factoring is the technique of deriving a single, more specific atom from a disjunction of two more general unifiable atoms. For example, from ∀ X, Y : P(X, a) or P(b, Y) we can derive P(b, a).
Arithmetic | Algebra | Mathematics
Faktorizace | Faktorisering | Primfaktorzerlegung | Factorisation | Þáttun | Fattorizzazione | Ontbinden in factoren | Faktoryzacja | Fatoração | Факторизация | Faktorisering | 因数分解
This article is licensed under the GNU Free Documentation License.
It uses material from the
"Factorization".
Home Page • arts • business • computers • games • health • hospitals • home • kids & teens • news • physicians • recreation• reference • regional • science • shopping • society • sports • world