chinese-remainder/src/gcd.js

A lightweight NPM package for solving modular equations using the Chinese Remainder Theorem (CRT). Supports modular inverse, LCM, and GCD calculations.

function gcd(a, b) {
    return b === 0 ? Math.abs(a) : gcd(b, a % b);
}

module.exports = gcd;