Function gcd

src/compute-engine/numerics/numeric-bigint.ts:4–7

(a: bigint, b: bigint)

import { bigPrimeFactors } from './primes.js';

export function gcd(a: bigint, b: bigint): bigint {
  while (b !== BigInt(0)) [a, b] = [b, a % b];
  return a < 0 ? -a : a;
}

export function lcm(a: bigint, b: bigint): bigint {
  // `lcm(0, n) = 0`: the general formula would divide by `gcd(0, 0) = 0`.