Bézout's equation
The Euclidean algorithm, properly done, starts with integers
a
and
b
and calculates integers
s
and
t
such that
sa
+
tb
divides both
a
and
b
. It follows that
sa
+
tb
is the greatest common divisor of
a
and
b
.
a
=
b
=