|
numtheory[migcdex] - compute solutions to the modulo N extended GCD problem
|
|
Calling Sequence
|
|
migcdex(N, a, b1, b2, ..., bn)
|
|
|
Parameters
|
|
|
N
|
-
|
positive integer
|
|
a
|
-
|
integer
|
|
b1, b2, ..., bn
|
-
|
integers
|
|
|
|
|
|
Description
|
|
|
•
|
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
|
![gcd(N,a,b[1],...,b[n])=gcd(N,(a+c[1] b[1]+...+c[n] b[n]))](/support/helpjp/helpview.aspx?si=6996/file04315/math76.png)
|
|
such that ![c[n], () .. (), c[2], c[1]](/support/helpjp/helpview.aspx?si=6996/file04315/math79.png) is lexicographically minimal among all such sequences.
|
|
|
Download Help Document
Was this information helpful?
