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

The return value is the sequence  of non-negative integers with

such that  is lexicographically minimal among all such sequences.