gcd

Find the greatest common divisor of numbers.

Similar: gcd, lcm.

function gcd(...xs)
// xs: a list of numbers

const {gcd} = require('extra-number');


gcd(6, 15);
// → 3

gcd(6, 15, 21);
// → 3

gcd(6, 15, 20);
// → 1

References

• Fastest way to compute the greatest common divisor
• Euclidean algorithm: Wikipedia