gcd

Get the greatest common devisor of two numbers

Installation

npm install @knutkirkhorn/gcd

import gcd from '@knutkirkhorn/gcd';

console.log(gcd(28, 2));
// => 2

Returns the gcd of number1 and number2. The gcd is computed using the Euclidean algorithm.

Name		Name	Last commit message	Last commit date
Latest commit History 35 Commits
.github/workflows		.github/workflows
.editorconfig		.editorconfig
.eslintrc.json		.eslintrc.json
.gitattributes		.gitattributes
.gitignore		.gitignore
.npmrc		.npmrc
LICENSE		LICENSE
README.md		README.md
index.d.ts		index.d.ts
index.js		index.js
index.test-d.ts		index.test-d.ts
package.json		package.json
test.js		test.js