gcd/example/n.js

compute the greatest common divisor using euclid's algorithm

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