compute the greatest common divisor using euclid's algorithm
JavaScript
Latest commit 3fe4f1d May 21, 2014 @substack fix for travis
Failed to load latest commit information.
example readme and an example Aug 12, 2012
test tape May 21, 2014
.travis.yml fix for travis May 21, 2014
LICENSE package.json Aug 12, 2012
index.js
package.json 0.0.1 May 21, 2014
readme.markdown testling May 21, 2014

readme.markdown

gcd

Compute the greatest common divisor using Euclid's algorithm.

testling badge

build status

example

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

11

methods

var gcd = require('gcd')

gcd(a, b)

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

install

With npm do:

npm install gcd

license

MIT