Bezout Numbers

Integers $(\lambda, \mu)$ for $a$ and $b$ such that

$$\lambda a + \mu b = \mathop{\rm GCD}\nolimits (a,b).$$

For Integers $a_1$, ..., $a_n$, the Bezout numbers are a set of numbers $k_1$, ..., $k_n$ such that

$$k_1 a_1 + k_2 a_2 + \ldots + k_n a_n = d,$$

where $d$ is the Greatest Common Divisor of $a_1$, ..., $a_n$.

See also Greatest Common Divisor