Returns the greatest common divisor (gcd) of two BigInt using Euclid's algorithm.
BigInt greatestCommonDivisorBig(BigInt a, BigInt b) => a.gcd(b);