Compute the greatest common divisor (Euclidean algorithm) and least common multiple of two positive integers. Also reports whether the two numbers are coprime (GCD = 1).