Terms
Fundamental Theorem of Arithmetic
The fundamental theorem of arithmetic states that every positive integer (save the number 1) can be represented in exactly one way apart from rearrangement as a product of one or more primes (Hardy and Wright 1979, pp. 2-3).
This theorem is also called the unique factorization theorem. The fundamental theorem of arithmetic is a corollary of the first of Euclid’s theorems (Hardy and Wright 1979).
REFERENCES
Hardy, G. H. and Wright, E. M. “Statement of the Fundamental Theorem of Arithmetic,” “Proof of the Fundamental Theorem of Arithmetic,” and “Another Proof of the Fundamental Theorem of Arithmetic.” §1.3, 2.10 and 2.11 in An Introduction to the Theory of Numbers, 5th ed. Oxford, England: Clarendon Press, pp. 3 and 21, 1979.
Weisstein, Eric W. “Fundamental Theorem of Arithmetic.” From MathWorld—A Wolfram Web Resource. https://mathworld.wolfram.com/FundamentalTheoremofArithmetic.html