The function igcd computes the greatest common divisor of an arbitrary number of integers.  The function ilcm computes the least common multiple of an arbitrary number of integers.

The igcd command is thread-safe as of Maple 15.

For more information on thread safety, see index/threadsafe.

$\mathrm{igcd}\left(\right)$

$0$

$\mathrm{ilcm}\left(\right)$

$1$

$\mathrm{igcd}\left(-10\,6\,-8\right)$

$2$

$\mathrm{ilcm}\left(-10\,6\,-8\right)$

$120$

$\mathrm{igcd}\left(a\,ab\right)$

$\mathrm{igcd}\left(a\,ab\right)$

$\gcd \left(a\,ab\right)$

$a$

$a≔6\:$

$b≔9\:$

$\mathrm{ilcm}\left(a\,b\right)$

$18$

$\mathrm{igcd}\left(a\,b\right)$

$3$