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 Algorithms
Famous quotes containing the word prime:
“By whatever means it is accomplished, the prime business of a play is to arouse the passions of its audience so that by the route of passion may be opened up new relationships between a man and men, and between men and Man. Drama is akin to the other inventions of man in that it ought to help us to know more, and not merely to spend our feelings.”
—Arthur Miller (b. 1915)