In mathematics, the Fundamental Theorem of Arithmetic, also called the Unique Factorization Theorem and Prime Factorization Theorem, states that every integer \(n\) greater than \(1\) is either prime or can be represented uniquely as a product of prime numbers, up to the order of the factors:
\[n=p_1^{e_1}\cdot p_2^{e_2} \cdots p_k^{e_k},\]
where \(p_1 < p_2 < \cdots < p_k\) are distinct prime numbers, and \(e_i \ge 1, 1\le i \le k\), are their multiplicites.
Fundamental Theorem of Arithmetic
Moderator: Euclid
