package
compute the greatest common divisor using euclid's algorithm
npm install gcdGitHub-flavored package documentation.
Across all versions.
Download trend unavailable.
Runtime metadata.
Tagged topics.
Compute the greatest common divisor using Euclid's algorithm.
var gcd = require('gcd');
var n = gcd(121,44);
console.log(n);11var gcd = require('gcd')Return the greatest common divisor of the integers a and b using Euclid's
algorithm.
With npm do:
npm install gcdMIT