Perform the greatest common divisor between two integers and the solutions of the Bezout's identity (Extended Euclidian algorithm).
[G,U,V] = NL_S_GCDExtended(A,B)
Integer.
Integer.
Greatest common divisor.
Bezout first factor.
Bezout second factor.
NL_S_GCDExtended performs the greatest common divisor (GCD) G of the two integers A and B in respect with the Extended Euclidian algorithm (WIKIPEDIA). It also finds the integers U and V (one of which is typically negative) that satisfy the Bézout's identity AU+BV=G.