JSPM

  • ESM via JSPM
  • ES Module Entrypoint
  • Export Map
  • Keywords
  • License
  • Repository URL
  • TypeScript Types
  • README
  • Created
  • Published
  • Downloads 3
  • Score
    100M100P100Q35202F
  • License MIT

Get the greatest common devisor of two numbers

Package Exports

  • @knutkirkhorn/gcd

This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (@knutkirkhorn/gcd) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.

Readme

gcd

Get the greatest common devisor of two numbers

Installation

$ npm install @knutkirkhorn/gcd

Usage

const gcd = require('@knutkirkhorn/gcd');

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

API

gcd(number1, number2)

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

License

MIT © Knut Kirkhorn