Prove that in a Euclidean domain, the least common multiple of a and b is equal to the product of a and b divided by the greatest common divisor of a and b?