| Factorization |
Articles about Factorization |
Information AboutFactorization |
| CATEGORIES ABOUT FACTORIZATION | |
| arithmetic | |
| algebra | |
|
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 ''x''2 − 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 , ''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 . FACTORING A QUADRATIC POLYNOMIAL Quadratic Equation s (equations in the form of ) can sometimes be factored into two binomials with simple integer coefficients, thus exposing their roots, without the need to use the Quadratic Formula . The formula : would be factored into : where : : : 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 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'' = {1⁄2, 2} 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: : : SUM/DIFFERENCE OF TWO SQUARES See Also: 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 subtraced, 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 . SUM/DIFFERENCE OF TWO CUBES Another less-used but still common formula for factoring is the sum or difference of two cubes. The sum can be represented by : and the difference by : For example, ''x''3 − 103 (or ''x''3 − 1000) can be factored into (''x'' − 10)(''x''2 + 10''x'' + 100). In general, the difference of any two numbers raised to the same (positive integer) power : contains the factor (''a'' - ''b''), and the sum of any two numbers raised to the same (positive integer) odd power : and the difference of any two numbers raised to the same (positive integer) even power contain the factor (''a'' + ''b''). PRIME FACTORIZATION OF AN INTEGER See Also: Integer factorization 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. See also: Prime Factorization Algorithms FACTORING IN MATHEMATICAL LOGIC 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''). SEE ALSO
EXTERNAL LINKS
|
|
|