compute solutions to the modulo N extended GCD problem
migcdex(N, a, b1, b2, ..., bn)
b1, b2, ..., bn
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 c1,c2,...,cn of non-negative integers with
such that cn,...,c2,c1 is lexicographically minimal among all such sequences.
Download Help Document
What kind of issue would you like to report? (Optional)