# Fundamental theorem of arithmetic

In mathematics, the fundamental theorem of arithmetic, also called the unique factorization theorem and prime factorization theorem, states that every integer greater than 1 can be represented uniquely as a product of prime numbers, up to the order of the factors. For example,
    $1200=2^{4}\cdot 3^{1}\cdot 5^{2}=(2\cdot 2\cdot 2\cdot 2)\cdot 3\cdot (5\cdot 5)=5\cdot 2\cdot 5\cdot 2\cdot 3\cdot 2\cdot 2=\ldots$
The theorem says two things about this example: first, that 1200 can be represented as a product of primes, and second, that no matter how this is done, there will always be exactly four 2s, one 3, two 5s, and no other primes in the product.
The requirement that the factors be prime is necessary: factorizations containing composite numbers may not be unique (for example, $12=2\cdot 6=3\cdot 4$).
This theorem is one of the main reasons why 1 is not considered a prime number: if 1 were prime, then factorization into primes would not be unique; for example, $2=2\cdot 1=2\cdot 1\cdot 1=\ldots$
The theorem generalizes to other algebraic structures that are called unique factorization domains and include principal ideal domains, Euclidean domains, and polynomial rings over a field. However, the theorem does not hold for algebraic integers. This failure of unique factorization is one of the reasons for the difficulty of the proof of Fermat's Last Theorem. The implicit use of unique factorization in rings of algebraic integers is behind the error of many of the numerous false proofs that have been written during the 358 years between Fermat's statement and Wiles's proof.

## History

The fundamental theorem can be derived from Book VII, propositions 30, 31 and 32, and Book IX, proposition 14 of Euclid's Elements.
   If two numbers by multiplying one another make some number, and any prime number measure the product, it will also measure one of the original numbers.
(In modern terminology: if a prime p divides the product ab, then p divides either a or b or both.) Proposition 30 is referred to as Euclid's lemma, and it is the key in the proof of the fundamental theorem of arithmetic.
   Any composite number is measured by some prime number.
(In modern terminology: every integer greater than one is divided evenly by some prime number.) Proposition 31 is proved directly by infinite descent.
   Any number either is prime or is measured by some prime number.
Proposition 32 is derived from proposition 31, and proves that the decomposition is possible.
   If a number be the least that is measured by prime numbers, it will not be measured by any other prime number except those originally measuring it.
(In modern terminology: a least common multiple of several prime numbers is not a multiple of any other prime number.) Book IX, proposition 14 is derived from Book VII, proposition 30, and proves partially that the decomposition is unique – a point critically noted by André Weil. Indeed, in this proposition the exponents are all equal to one, so nothing is said for the general case.
While Euclid took the first step on the way to the existence of prime factorization, Kamāl al-Dīn al-Fārisī took the final step and stated for the first time the fundamental theorem of arithmetic.
Article 16 of Gauss's Disquisitiones Arithmeticae is an early modern statement and proof employing modular arithmetic.

## Applications
### Canonical representation of a positive integer

Every positive integer n > 1 can be represented in exactly one way as a product of prime powers
    $n=p_{1}^{n_{1}}p_{2}^{n_{2}}\cdots p_{k}^{n_{k}}=\prod _{i=1}^{k}p_{i}^{n_{i}},$
where p$_1$ < p$_2$ < ... < p$_k$ are primes and the n$_i$ are positive integers. This representation is commonly extended to all positive integers, including 1, by the convention that the empty product is equal to 1 (the empty product corresponds to k = 0).
This representation is called the canonical representation of n, or the standard form of n. For example,
    999 = 3$^3$×37,
    1000 = 2$^3$×5$^3$,
    1001 = 7×11×13.
Factors p$^0$ = 1 may be inserted without changing the value of n (for example, 1000 = 2$^3$×3$^0$×5$^3$). In fact, any positive integer can be uniquely represented as an infinite product taken over all the positive prime numbers, as
    $n=2^{n_{1}}3^{n_{2}}5^{n_{3}}7^{n_{4}}\cdots =\prod _{i=1}^{\infty }p_{i}^{n_{i}},$
where a finite number of the n$_i$ are positive integers, and the others are zero.
Allowing negative exponents provides a canonical form for positive rational numbers.

### Arithmetic operations

The canonical representations of the product, greatest common divisor (GCD), and least common multiple (LCM) of two numbers a and b can be expressed simply in terms of the canonical representations of a and b themselves:
    ${\begin{alignedat}{2}a\cdot b&=2^{a_{1}+b_{1}}3^{a_{2}+b_{2}}5^{a_{3}+b_{3}}7^{a_{4}+b_{4}}\cdots &&=\prod p_{i}^{a_{i}+b_{i}},\\\gcd(a,b)&=2^{\min(a_{1},b_{1})}3^{\min(a_{2},b_{2})}5^{\min(a_{3},b_{3})}7^{\min(a_{4},b_{4})}\cdots &&=\prod p_{i}^{\min(a_{i},b_{i})},\\\operatorname {lcm} (a,b)&=2^{\max(a_{1},b_{1})}3^{\max(a_{2},b_{2})}5^{\max(a_{3},b_{3})}7^{\max(a_{4},b_{4})}\cdots &&=\prod p_{i}^{\max(a_{i},b_{i})}.\end{alignedat}}$
However, integer factorization, especially of large numbers, is much more difficult than computing products, GCDs, or LCMs. So these formulas have limited use in practice.

### Arithmetic functions

Many arithmetic functions are defined using the canonical representation. In particular, the values of additive and multiplicative functions are determined by their values on the powers of prime numbers.

## Proof

The proof uses Euclid's lemma (Elements VII, 30): If a prime divides the product of two integers, then it must divide at least one of these integers.

### Existence

It must be shown that every integer greater than 1 is either prime or a product of primes. First, 2 is prime. Then, by strong induction, assume this is true for all numbers greater than 1 and less than n. If n is prime, there is nothing more to prove. Otherwise, there are integers a and b, where n = a b, and 1 < a ≤ b < n. By the induction hypothesis, a = p$_1$ p$_2$ ⋅⋅⋅ p$_j$ and b = q$_1$ q$_2$ ⋅⋅⋅ q$_k$ are products of primes. But then n = a b = p$_1$ p$_2$ ⋅⋅⋅ p$_j$ q$_1$ q$_2$ ⋅⋅⋅ q$_k$ is a product of primes.

### Uniqueness

Suppose, to the contrary, there is an integer that has two distinct prime factorizations. Let n be the least such integer and write n = p$_1$ p$_2$ ... p$_j$ = q$_1$ q$_2$ ... q$_k$, where each p$_i$ and q$_i$ is prime. We see that p$_1$ divides q$_1$ q$_2$ ... q$_k$, so p$_1$ divides some q$_i$ by Euclid's lemma. Without loss of generality, say p$_1$ divides q$_1$. Since p$_1$ and q$_1$ are both prime, it follows that p$_1$ = q$_1$. Returning to our factorizations of n, we may cancel these two factors to conclude that p$_2$ ... p$_j$ = q$_2$ ... q$_k$. We now have two distinct prime factorizations of some integer strictly smaller than n, which contradicts the minimality of n.

### Uniqueness without Euclid's lemma

The fundamental theorem of arithmetic can also be proved without using Euclid's lemma. The proof that follows is inspired by Euclid's original version of the Euclidean algorithm.
Assume that $s$ is the smallest positive integer which is the product of prime numbers in two different ways. Incidentally, this implies that $s$, if it exists, must be a composite number greater than $1$. Now, say
    ${\begin{aligned}s&=p_{1}p_{2}\cdots p_{m}\\&=q_{1}q_{2}\cdots q_{n}.\end{aligned}}$
Every $p_{i}$ must be distinct from every $q_{j}.$ Otherwise, if say $p_{i}=q_{j},$ then there would exist some positive integer $t=s/p_{i}=s/q_{j}$ that is smaller than s and has two distinct prime factorizations. One may also suppose that $p_{1}<q_{1},$ by exchanging the two factorizations, if needed.
Setting $P=p_{2}\cdots p_{m}$ and $Q=q_{2}\cdots q_{n},$ one has $s=p_{1}P=q_{1}Q.$ Also, since $p_{1}<q_{1},$ one has $Q<P.$ It then follows that
    $s-p_{1}Q=(q_{1}-p_{1})Q=p_{1}(P-Q)<s.$
As the positive integers less than s have been supposed to have a unique prime factorization, $p_{1}$ must occur in the factorization of either $q_{1}-p_{1}$ or Q. The latter case is impossible, as Q, being smaller than s, must have a unique prime factorization, and $p_{1}$ differs from every $q_{j}.$ The former case is also impossible, as, if $p_{1}$ is a divisor of $q_{1}-p_{1},$ it must be also a divisor of $q_{1},$ which is impossible as $p_{1}$ and $q_{1}$ are distinct primes.
Therefore, there cannot exist a smallest integer with more than a single distinct prime factorization. Every positive integer must either be a prime number itself, which would factor uniquely, or a composite that also factors uniquely into primes, or in the case of the integer $1$, not factor into any prime.

## Generalizations

The first generalization of the theorem is found in Gauss's second monograph (1832) on biquadratic reciprocity. This paper introduced what is now called the ring of Gaussian integers, the set of all complex numbers a + bi where a and b are integers. It is now denoted by $\mathbb {Z} [i].$ He showed that this ring has the four units ±1 and ±i, that the non-zero, non-unit numbers fall into two classes, primes and composites, and that (except for order), the composites have unique factorization as a product of primes (up to the order and multiplication by units).
Similarly, in 1844 while working on cubic reciprocity, Eisenstein introduced the ring $\mathbb {Z} [\omega ]$, where ω=(−1+√(−3))/2, {\textstyle \omega ={\frac {-1+{\sqrt {-3}}}{2}}, } $\omega ^{3}=1$ is a cube root of unity. This is the ring of Eisenstein integers, and he proved it has the six units $\pm 1,\pm \omega ,\pm \omega ^{2}$ and that it has unique factorization.
However, it was also discovered that unique factorization does not always hold. An example is given by $\mathbb {Z} [{\sqrt {-5}}]$. In this ring one has
    $6=2\cdot 3=\left(1+{\sqrt {-5}}\right)\left(1-{\sqrt {-5}}\right).$
Examples like this caused the notion of "prime" to be modified. In $\mathbb {Z} \left[{\sqrt {-5}}\right]$ it can be proven that if any of the factors above can be represented as a product, for example, 2 = ab, then one of a or b must be a unit. This is the traditional definition of "prime". It can also be proven that none of these factors obeys Euclid's lemma; for example, 2 divides neither (1 + √−5) nor (1 − √−5) even though it divides their product 6. In algebraic number theory 2 is called irreducible in $\mathbb {Z} \left[{\sqrt {-5}}\right]$ (only divisible by itself or a unit) but not prime in $\mathbb {Z} \left[{\sqrt {-5}}\right]$ (if it divides a product it must divide one of the factors). The mention of $\mathbb {Z} \left[{\sqrt {-5}}\right]$ is required because 2 is prime and irreducible in $\mathbb {Z} .$ Using these definitions it can be proven that in any integral domain a prime must be irreducible. Euclid's classical lemma can be rephrased as "in the ring of integers $\mathbb {Z}$ every irreducible is prime". This is also true in $\mathbb {Z} [i]$ and $\mathbb {Z} [\omega ],$ but not in $\mathbb {Z} [{\sqrt {-5}}].$
The rings in which factorization into irreducibles is essentially unique are called unique factorization domains. Important examples are polynomial rings over the integers or over a field, Euclidean domains and principal ideal domains.
In 1843 Kummer introduced the concept of ideal number, which was developed further by Dedekind (1876) into the modern theory of ideals, special subsets of rings. Multiplication is defined for ideals, and the rings in which they have unique factorization are called Dedekind domains.
There is a version of unique factorization for ordinals, though it requires some additional conditions to ensure uniqueness.
Any commutative Möbius monoid satisfies a unique factorization theorem and thus possesses arithmetical properties similar to those of the multiplicative semigroup of positive integers. Fundamental Theorem of Arithmetic is, in fact, a special case of the unique factorization theorem in commutative Möbius monoids.