Calculate the GCD (greatest common divisor) and LCM (least common multiple) of two positive integers using the Euclidean algorithm relationship.
Formula
LCM(a,b) = (a × b) / GCD(a,b)