gcdlcm.js

Fast and simple gcd/lcm implementation in JavaScript using the Euclidean algorithm.

Installation

npm i gcdlcm.js

Import

const { gcd, lcm } = require("gcdlcm.js");    // cjs

// or

import gcdlcm from "gcdlcm.js";
const { gcd, lcm } = gcdlcm;

Examples

gcd(2, 3)   // 1
gcd(2, 4)   // 2

lcm(2, 3)   // 6
lcm(2, 4)   // 4

The gcdn/lcmn functions can take an arbitrary amount of parameters.
Note that gcd/lcm is faster when only two parameters are given.

const { gcdn, lcmn } = require("gcdlcm.js");

gcdn(2, 3, 4)       // 1
gcdn(2, 4, 6, 8)    // 2

lcmn(2, 3, 4)       // 12
lcmn(2, 4, 5, 6)    // 60