GCD | npm.io

the call will result the GCD fo two numbers which are passed as parameters in call var gcd=require("publish_test_sakshi_kottawar/gcd"); var ans=gcd.GCD(5,6);

gcd GCD Greatest Common Divisor

1.0.1 • Published 7 years ago

Compute the greatest common divisor (gcd).

stdlib stdmath math mathematics euclid euclidean stein binary gcd greatest common divisor greatest common factor

0.3.0 • Published 2 years ago

Compute the least common multiple (lcm).

stdlib stdmath math mathematics euclid euclidean least common multiple lowest common multiple smallest common multiple lowest common denominator

0.3.0 • Published 2 years ago

Lightweight utils for every project

utils clean-obj object array lodash ramda get-enum-values unnest plain-object odd

1.10.1 • Published 4 years ago

GCD + Euclidean algorithm

algorithm gcd extended euclidean algorithm

4.0.4 • Published 2 years ago

Get the greatest common devisor of two numbers

gcd greatest common devisor cli math

3.0.1 • Published 3 years ago

Some common functions for modular arithmetic using native JS implementation of BigInt

modular arithmetics BigInt lcm gcd egcd modinv modular inverse modpow modular exponentiation

1.0.0 • Published 3 years ago

13 4

GCD Packages

publish_test_sakshi_kottawar

@stdlib/math-base-special-gcd

@stdlib/math-base-special-lcm

@techmmunity/utils

@algorithm.ts/gcd

@knutkirkhorn/gcd-cli

@lumeweb/bigint-mod-arith