Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
compute the greatest common divisor using euclid's algorithm
tree: 6be237b4c4

Fetching latest commit…

Cannot retrieve the latest commit at this time

Failed to load latest commit information.
example
test
index.js
readme.markdown

readme.markdown

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')

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

Something went wrong with that request. Please try again.