solutions to the modulo n extended GCD problem
ModExtendedGCD(n, a, b)
sequence of integers
The ModExtendedGCD function computes the solution to the modulo n extended greatest common divisor problem.
If b is a sequence of length k, then the return value is a list c of length k of non-negative integers such that gcd⁡n,a,b1,…,bk=gcd⁡n,a+c1⁢b1+⋯+ck⁢bk and ck,…,c1 is lexicographically minimal.
ModExtendedGCD(150, 5, 75, 25);
ModExtendedGCD(150, 9, 75, 25);
Arne Storjohann. A solution to the extended GCD problem with applications. Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (ISSAC '97), ACM Press, 1997.
The NumberTheory[ModExtendedGCD] command was introduced in Maple 2016.
For more information on Maple 2016 changes, see Updates in Maple 2016.
Download Help Document
What kind of issue would you like to report? (Optional)