Integer factorization

In mathematics, integer factorization is the decomposition of a positive integer into a product of integers. Every positive integer greater than 1 is either the product of two or more integer factors greater than 1, in which case it is a composite number, or it is not, in which case it is a prime number. For example, 15 is a composite number because 60 = 3 · 20 = 3 · (5 · 4). Continuing this process until every factor is prime is called prime factorization; the result is always unique up to the order of the factors by the prime factorization theorem.

To factorize a small integer 3, n = 864 as 5</sup> × 3³"}},"i":0}}]}'/>2 × 3

By the fundamental theorem of arithmetic, every positive integer has a unique prime factorization. (By convention, 1 is the empty product.) Testing whether the integer is prime can be done in polynomial time, for example, by the AKS primality test. If composite, however, the polynomial time tests give no insight into how to obtain the factors.

Given a general algorithm for integer factorization, any integer can be factored into its constituent prime factors by repeated application of this algorithm. The situation is more complicated with special-purpose factorization algorithms, whose benefits may not be realized as well or even at all with the factors produced during decomposition. For example, if p divisions to find the next factor. As a contrasting example, if 1372933, and a − b = 18848997157 and a is a factor of 10 from

Among the n in time ''k''</sup>)"}},"i":0}}]}'/>O(b) for some constant ε, that is, sub-exponential. n in time )"}},"i":0}}]}'/>O(b) time and and <math>k</math>, does {{math|''n''}} have a factor smaller than {{math|''k''}} besides 1? "},"name":{"wt":"Decision problem"},"note":{"wt":"Integer factorization"}},"i":0}}]}'>