Fundamental theorem of arithmetic

Every whole number greater than 1 is a product of primes, in exactly one way (apart from order). History: Euclid, c. 300 BC; Gauss, 1801.

n = p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k}

How to work it out

1
The statement:
$n = p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k}$
2
Every whole number greater than 1 is a product of primes, in exactly one way (apart from order).
3
Below, the numbers in the table are computed by this site from the definition, not copied.

LaTeX source of the formulas on this page

\[ n = p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k} \]

What is the fundamental theorem of arithmetic?

Every whole number greater than 1 is a product of primes, in exactly one way (apart from order).

Who is the Fundamental theorem of arithmetic associated with?

Euclid, Carl Friedrich Gauss.