gcd

Compute the greatest common divisor using
Euclid's algorithm.

install

``bash
npm install @japan-d2/gcd
`

or

`bash
yarn add @japan-d2/gcd
`

how to use

example

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

$3

`
7
`

methods

$3

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

BigInt support

example

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

$3

`
7n
`

methods

$3

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

license

MIT