Function gcd

gcd(a: NumLike, b: NumLike): bigint
Calculate the greatest common divisor (GCD) of two NumLike values using the Euclidean algorithm.
Parameters
- a: NumLike
  First operand.
- b: NumLike
  Second operand.
Returns bigint
GCD(a, b) as a Num.
- Defined in utils/index.ts:276