gcd

compute the greatest common divisor using euclid's algorithm

gcd

Compute the greatest common divisor using Euclid's algorithm.

example

var gcd = require('gcd');
var n = gcd(121,44);
console.log(n);

11

methods

var gcd = require('gcd')

Return the greatest common divisor of the integers a and b using Euclid's algorithm.

install

With npm do:

npm install gcd

license

MIT