You're Invited:Meet the Socket Team at BlackHat and DEF CON in Las Vegas, Aug 4-6.RSVP
Socket
Book a DemoInstallSign in
Socket

gcd

Package Overview
Dependencies
Maintainers
1
Versions
2
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

gcd

compute the greatest common divisor using euclid's algorithm

0.0.1
latest
Source
npmnpm
Version published
Weekly downloads
46K
-5.95%
Maintainers
1
Weekly downloads
 
Created
Source

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

Keywords

gcd

FAQs

Package last updated on 21 May 2014

Did you know?

Socket

Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.

Install

Related posts