Returns the greatest common divisor and the coefficients of Bezout's lemma: let a and b nonzero integers and let d be their greatest common divisor. Then there exist integers x and y such that a x plus b y equals d.

bezout(Integer, Integer)

Given two nonzero integers a and b, returns a vector: the first element is the greatest common divisor, the second element is x and the third one is y, following the notation above.