 Bézout's identity, and therefore the previous algorithm, can both be generalized to the context of Euclidean domains.Bézout's identity provides yet another definition of the greatest common divisor "g" of two numbers "a" and "b".Consider the set of all numbers "ua" + "vb", where "u" and "v" are any two integers.