Greatest Common Divisor (LCM * GCD)
To find LCM, we can make it more efficient by using the fact that the product of two numbers is equal to the product of the least common multiple and greatest common divisor of those two numbers.
▪︎ Number1 * Number2 = L.C.M. * G.C.D.
Here is a Python program to implement this.