Fundamental Theorem of Arithmetic

In this section of fundamental theorem of arithmetic we will learn about its various applications . For example, we have used prime factorization method to find GCF (HCF) and LCM of positive integers. In this method, we use the fundamental arithmetic theorem in expressing the given integers as the product of primes.
Take any collection of prime numbers, say 2, 3, 7, 11 and 23. If we multiply
some or all of these numbers, allowing them to repeat as many times as we wish,
we can produce a large collection of positive integers (In fact, infinitely many).
Let us list a few :
1771 = 7 × 11 × 23
8232 = 2 x 2 x 2 x 3 x 7 x 7 x 7
∴ 8232 = 23 x 3 x 73 and so on.

Theorem (Fundamental Arithmetic Theorem) : Every composite number can be expressed ( factorized) as a product of primes, and this factorization is unique, apart from the order in which the prime factors occur.

The Fundamental Theorem of Arithmetic says that every composite number can be factorized as a product of primes.
It says that given any composite number it can be factorized as a product of prime numbers in a
‘unique’ way, except for the order in which the primes occur. That is, given any composite number there is one and only one way to write it as a product of primes, as long as we are not particular about the order in which the primes occur. So, for example, 2 × 3 × 5 × 7 as the same as 3 × 5 × 7 × 2, or any other
possible order in which these primes are written. This fact is also stated in the
following form: The prime factorization of a natural number is unique, except for the order
of its factors.