TOPICS
Search

Bézout Numbers


Integers (lambda,mu) for a and b that satisfy Bézout's identity

 lambdaa+mub=GCD(a,b)

are called Bézout numbers. For integers a_1, ..., a_n, the Bézout numbers are a set of numbers k_1, ..., k_n such that

 k_1a_1+k_2a_2+...+k_na_n=d,

where d is the greatest common divisor of a_1, ..., a_n.


See also

Bézout's Identity, Greatest Common Divisor

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Bézout Numbers." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/BezoutNumbers.html

Subject classifications