In number theory, the fundamental theorem of arithmetic (or unique-prime-factorization theorem) states that every natural number greater than 1 can be written as a unique product of prime numbers. For instance,
There are no other possible factorizations of 6936 or 1200 into prime numbers. The above representation collapses repeated prime factors into powers for easier identification. Because multiplication is commutative and associative, the order of factors is irrelevant and usually written from least to greatest.
Many authors take the natural numbers to begin with 0, which has no prime factorization. Thus Theorem 1 of Hardy & Wright (1979) takes the form, “Every positive integer, except 1, is a product of primes”, and Theorem 2 (their "Fundamental") asserts uniqueness. The number 1 is not itself prime, but since it is the product of no numbers, it is often convenient to include it in the theorem by the empty product rule. (See, for example, Calculating the gcd.)
Hardy & Wright define an abnormal number to be a hypothetical number that does not have a unique prime factorization. They prove the fundamental theorem of arithmetic by proving that there does not exist an abnormal number.
Contents |
The fundamental theorem of arithmetic establishes the importance of prime numbers. Prime numbers are the basic building blocks of any positive integer, in the sense that each positive integer can be constructed from the product of primes with one unique construction. Finding the prime factorization of an integer allows derivation of all its divisors, both prime and non-prime.
The fundamental theorem ensures that additive and multiplicative arithmetic functions are completely determined by their values on the powers of prime numbers.
The theorem was practically proved by Euclid, but the first full and correct proof is found in the Disquisitiones Arithmeticae by Carl Friedrich Gauss. It may be important to note that Egyptians like Ahmes used earlier practical aspects of the factoring, and lowest common multiple, of the fundamental theorem of arithmetic allowing a long tradition to develop, as formalized by Euclid, and rigorously proven by Gauss.
Although at first sight the theorem seems 'obvious', it does not hold in more general number systems, including many rings of algebraic integers. This was first pointed out by Ernst Kummer in 1843, in his work on Fermat's Last Theorem. The recognition of this failure is one of the earliest developments in algebraic number theory.
The proof consists of two steps. In the first step every number is shown to be a product of zero or more primes. In the second, the proof shows that any two representations may be unified into a single representation.
Suppose there were a positive integer which cannot be written as a product of primes. Then there must be a smallest such number (see well-order): let it be n. This number n cannot be 1, because of the empty-product convention above. It cannot be a prime number either, since any prime number is a product of a single prime, itself. So it must be a composite number. Thus
where both a and b are positive integers smaller than n. Since n is the smallest number which cannot be written as a product of primes, both a and b can be written as products of primes. But then
can be written as a product of primes as well, a proof by contradiction. This is a minimal counterexample argument.
By distributivity: