gcd-component
v1.0.3
Published
Greatest common divisor component
Readme
gcd
Greatest common divisor component.
Installation
$ component install KenanY/gcdAPI
gcd(x, y)
Calculate the greastest common divisor amongst Numbers x and y.
gcd(1254, 5298);
// => 6Development
$ npm install
$ makeLicense
MIT

