@japan-d2/gcd
TypeScript icon, indicating that this package has built-in type declarations

0.0.8 • Public • Published

gcd

Compute the greatest common divisor using Euclid's algorithm.

install

npm install @japan-d2/gcd

or

yarn add @japan-d2/gcd

how to use

example

import gcd from '@japan-d2/gcd'
console.log(gcd(721, 161))

Output

7

methods

gcd(a: number, b: number): number

Return the greatest common divisor of the integers a and b using Euclid's algorithm.

BigInt support

example

import gcd from '@japan-d2/gcd/lib/bigint'
console.log(gcd(721n, 161n))

Output

7n

methods

gcd(a: bigint, b: bigint): bigint

Return the greatest common divisor of the integers a and b using Euclid's algorithm.

license

MIT

Package Sidebar

Install

npm i @japan-d2/gcd

Weekly Downloads

18

Version

0.0.8

License

MIT

Unpacked Size

3.57 kB

Total Files

7

Last publish

Collaborators

  • tatat
  • uneco