Question: gcdex procedure and extended euclidean algorithm

I am trying to find the maple procedure to do the extended euclidean algorithm which computes the gcd(A, B) such that the gcd(A, B) = A*r + B*s for some integers r and s. I want the integers r and s.

is gcdex() the right maple procedure (I cannot get it to work). Or what procedure can I use?



Please Wait...