In mathematics, and in particular number theory, the fundamental theorem of arithmetic is the statement that every positive integer can be written as a product of prime numbers in a unique way. For instance, we can write
To make the theorem work even for the number 1, we think of 1 as being the product of zero prime numbers (see empty product).
The theorem establishes the importance of prime numbers. Essentially, they are the "basic building blocks" of the positive integers, in that every positive integer can be put together from primes in a unique fashion.
Knowing the prime number factorization of a number gives complete knowledge about all factors of that number. For instance, the above factorization of 6936 tells us that the positive factors of 6936 are of the form
Once the prime factorizations of two numbers are known, their greatest common divisor and least common multiple can be found quickly. For instance, from the above we see that the greatest common divisor of 6936 and 1200 is 23 · 3 = 24. However if the prime factorizations are not known, the use of Euclid's algorithm generally requires much less calculation than factoring the two numbers.
The fundamental theorem ensures that additive and multiplicative arithmetic functions are completely determined by their values on the powers of prime numbers.
The proof consists of two parts: first, we have to show that every number can indeed be written as a product of primes; then we have to show that any two such representations are essentially the same.
Suppose there were a positive integer which can not be written as a product of primes. Then there must be a smallest such number: let's call it n. This number n cannot be 1, because of our convention above. It cannot be a prime number either, since any prime number is a product of a single prime, itself. So n = ab where both a and b are positive integers smaller than n. Since n was the smallest number for which the theorem fails, both a and b can be written as products of primes. But then n = ab can be written as a product of primes as well, a contradiction.
The uniqueness part of the proof hinges on the following fact: if a prime number p divides a product ab, then it divides a or it divides b (Proof: if p doesn't divide a, then p and a are relatively prime and Bézout's identity yields integers x and y such that px + ay = 1. Multiplying with b yields pbx + aby = b. Both summands of the left-hand side are divisible by p, so the right-hand side is also divisible by p.) Now take two products of primes which are equal. Take any prime p from the first product. It divides the first product, and hence also the second. By the above fact, p must then divide at least one factor in the second product. But the factors are all primes themselves, so p must actually be equal to one of the factors of the second product. So we can cancel p from both products. Continuing in this fashion, we eventually see that the prime factors of the two products must match up precisely.
See also: Prime factorization algorithmApplications
with [0 ≤ a ≤ 3], [0 ≤ b ≤ 1], and [0 ≤ c ≤ 2]. This yields a total of 4 · 2 · 3 = 24 positive factors.Proof
Another proof of the uniqueness of the prime factorization of a given integer uses infinite descent: Assume that a certain integer can be written as (at least) two different products of prime numbers, then there must exist a smallest integer s with such a property. Call the two products of s p1*...*pm and q1*...*qn. No pi (with 1≤i≤m) can be equal to any qj (with 1≤j≤n), as there would otherwise be a smaller integer factorizable in two ways (by removing prime factors common in both products) violating our assumption. We can now assume without loss of generality that p1 is a prime factor smaller than any qj (with 1≤j≤n). Take q1. Then there exist integers d and r such that q1/p1 = d+r/p1 and 0