-
MathType
-
Wiris Quizzes
-
Learning Lemur
-
CalcMe
-
MathPlayer
-
Store FAQ
-
VPAT for the electronic documentation
-
MathFlow
-
BF FAQ
Bezout
Reading time: 1minReturns 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 ax+by=d.
Syntax
bezout(Integer, Integer)
Description
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.
