bigint-gcd (npm): greater common divisor (gcd) of two BigInt values using Lehmer's GCD algorithm
Keywords: gcd|Euclid|Lehmer|Subquadratic|greatest common divisor|BigInt