Compute the greatest common divisor (GCD) and least common multiple (LCM) of two or more positive integers. Supports BigInt for arbitrarily large numbers and shows the full Euclidean algorithm trace plus prime factorizations.