Noun
fundamental theorem of arithmetic (uncountable)
(number theory) the theorem that states that every integer greater than one is uniquely expressible as a product of prime numbers, which is called its prime factorization
In this determination, it is convenient to use the characterization that a and b are coprime if and only if no prime number divides both of them (see Fundamental theorem of arithmetic ). Source: Internet