Extended gcd

Returns the final results of the extended Euclidean algorithm: an extension to the Euclidean algorithm which computes, besides the greatest common divisor of integers a and b, the coefficients of Bézout's identity, which are integers x and y such that ax+by=gcd(a,b)


extended_gcd(Integer, Integer)


Given two integers aLaTeXa and bLaTeXb, returns a vector with three elements: the first one is the greatest common divisor of aLaTeXa and bLaTeXb, the second and the third ones are xLaTeXx and yLaTeXy, with the notation used above.