Prime factorization

Fundamental Theorem of Arithmetic
Every counting number greater than 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).
References
Amsavalli. (2020, October 24). [i]Prime factorization[/i]. GeoGebra. https://www.geogebra.org/m/rwrmctxp. [br][br]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.[br][br]Paudyal, C. P. (2020, October 24). [i]Prime factorization[/i]. GeoGebra. https://www.geogebra.org/m/eq2xdk6t. [br][br][br]

Information: Prime factorization