Important: The numtheory package has been deprecated.  Use the superseding command NumberTheory[ModExtendedGCD] instead.

The function migcdex computes a solution to the modulo $N$ greatest common divisor problem for an arbitrary number of integers.

The return value is the sequence $\mathrm{c1},\mathrm{c2},...,\mathrm{cn}$ of non-negative integers with

such that $\left(c_n,...,c_2,c_1\right)$ is lexicographically minimal among all such sequences.

$\mathrm{with}\left(\mathrm{numtheory}\right)\:$

$\mathrm{migcdex}\left(150\,0\right)$

$\mathrm{migcdex}\left(150\,5\,75\,25\right)$

$0,0$

$\mathrm{migcdex}\left(150\,9\,75\,25\right)$

$1,1$