gcd
Compute the greatest common divisor using Euclid's algorithm.
example
var gcd = ;var n = ;console;
11
methods
var 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