Skip to main content

Bezout

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 + b y = 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.

arithmetic.bezout.calc.png

:

Was this helpful?

Would you like to provide feedback? Just click here to suggest edits.