Remark

From the theorem it is immediately clear that there is an algorithm to compute the lcm of two integers (not equal to 0) using an algorithm to compute the gcd.

The prime factorization is very well suited for studying the multiplicative structure of the integers. However, it is not so convenient to study the additive structure.