Prime Decomposition
By the fundamental theorem of arithmetic, every positive integer has a unique prime factorization. (A special case for 1 is not needed using an appropriate notion of the empty product.) However, the fundamental theorem of arithmetic gives no insight into how to obtain an integer's prime factorization; it only guarantees its existence.
Given a general algorithm for integer factorization, one can factor any integer down to its constituent prime factors by repeated application of this algorithm. However, this is not the case with a special-purpose factorization algorithm, since it may not apply to the smaller factors that occur during decomposition, or may execute very slowly on these values. For example, if N is the number (2521 − 1) × (2607 − 1), then trial division will quickly factor 10N as 2 × 5 × N, but will not quickly factor N into its factors.
Read more about this topic: Integer Factorization
Famous quotes containing the word prime:
“In time, after a dozen years of centering their lives around the games boys play with one another, the boys’ bodies change and that changes everything else. But the memories are not erased of that safest time in the lives of men, when their prime concern was playing games with guys who just wanted to be their friendly competitors. Life never again gets so simple.”
—Frank Pittman (20th century)