chinese-remainder/src/isCoprime.js

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

const extendedGCD = require("./extendedGCD");

function isCoprime(a, b) {
    return extendedGCD(a, b).gcd === 1;
}

module.exports = isCoprime;