Bézout’s Identity states that for any integers a and b, there
exist integers u and v such that gcd(a,b)=au+bv. The
iegcd or
igcdex command computes the
coefficients u and v.
iegcd takes two arguments:
a and b, integers.
iegcd(a,b) returns the list
[u,v,d], where au+bv=d and d=gcd(a,b).
