Bezout
Returns the greatest common divisor and the coefficients of Bezout's lemma: let and nonzero integers and let be their greatest common divisor. Then there exist integers and such that .
Syntax
bezout(Integer, Integer)
Description
Given two nonzero integers and , returns a vector: the first element is the greatest common divisor, the second element is and the third one is , following the notation above.
 |