The theorem guarantees that prime factorization is unique up to the order of the factors. Since \(2 \cdot 3 \cdot 5\) and \(5 \cdot 3 \cdot 2\) have the same primes with the same exponents, they describe the same decomposition.
Every integer greater than 1 can be written uniquely as a product of primes, up to the order of the factors. It is the foundation of most of elementary number theory.
\[n = p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k}\]
More practice problems: fundamental theorem of arithmetic