lcm191.1kMIT0.0.3compute the least common multiple using Euclidean algorithm
nickleeflyabout 3 years agolcm, math, euclidean compute-lcm4.4m1.1.2Computes the least common multiple (lcm).
compute-ioabout 3 years agolcm, compute.io, compute, computation bigint-mod-arith564.5kMIT3.3.1Some common functions for modular arithmetic using native JS implementation of BigInt
juanelasabout 2 years agolcm, modular arithmetics, BigInt, gcd extra-bigint109.4kMIT1.2.1A BigInt can represent whole numbers larger than 2⁵³ - 1.
nodef3 months agolcm, extra, bigint, big lcms-wasm33.1kMIT1.0.5LittleCMS in JS with WASM
mattdesl6 months agolcm, lcms, cmyk, cmy