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:
“If Montaigne is a man in the prime of life sitting in his study on a warm morning and putting down the sum of his experience in his rich, sinewy prose, then Pascal is that same man lying awake in the small hours of the night when death seems very close and every thought is heightened by the apprehension that it may be his last.”
—Cyril Connolly (1903–1974)