Bézout's identity
Bézout's identity
Bézout identity
Bézout identity
Bézout's lemma
Bézout's lemma
Diophantine equations
Diophantine equations
Bézout's identity
Bézout's identity
sh2007006114
Work cat.: Lawton, W.M. Bézout identities with inequality constraints, 1998.
found
Wikipedia, July 31, 2007
(Bézout's identity or Bézout's lemma is a linear diophantine equation. It states that if a and b are nonzero integers with greatest common divisor d, then there exist integers x and y (called Bézout numbers or Bézout coefficients) such that ax + by = d)
found
MathWorld, via WWW, July 31, 2007
(Bézout's identity -- If a and b are integers not both equal to 0, then there exist integers u and v such that GCD (a, b) = au + bv, where GCD (a, b) is the greatest common divisor of a and b)
found
Fermat's last theorem : Bezout's identity for Gaussian integers, via WWW, July 31, 2007
(Bezout's identity states that the greatest common denominator of any two integers can be expressed as a linear combination with two other integers)
found
Glossary of mathematical terms, via WWW, July 31, 2007
(Euclid's algorithm ... The generalization of the Corollary [for Euclid's algorithm] to an arbitrary field is known as Bézout's identity or Bézout's Lemma ...)
found
James, R.C. Mathematics dictionary, 1992;The Penguin dictionary of mathematics, 1989;Dictionary of applied math for engineers and scientists, 2003;Encyclopedic dictionary of mathematics, 1987
notfound
2009-10-23T00:00:00
new
2009-10-24T07:58:12
revised
Bézout's identity
Bézout identity
Bézout identity
Bézout's lemma
Bézout's lemma
Diophantine equations
Bézout's identity
Bézout's identity
Bézout identity
Bézout's lemma
2009-10-23T00:00:00
new
2009-10-24T07:58:12
revised