greatestCommonDivisorBig function

BigInt greatestCommonDivisorBig (BigInt a, BigInt b)

Returns the greatest common divisor (gcd) of two BigInt using Euclid's algorithm.

Implementation

BigInt greatestCommonDivisorBig(BigInt a, BigInt b) => a.gcd(b);