Non User
  Index: > A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Business
Non User
 Industries Finance Tax

Home > Bézout's identity


In number theory, Bézout's identity, named after Étienne Bézout, is a linear diophantine equation. It states that if a and b are integers with greatest common divisor d, then there exist integers x and y such that
ax + by = d.

Numbers x and y as above can be determined with the extended Euclidean algorithm, but they are not uniquely determined.

For example, the greatest common divisor of 12 and 42 is 6, and we can write

(−3)ˇ12 + 1ˇ42 = 6

and also

4ˇ12 + (−1)ˇ42 = 6.

The greatest common divisor d of a and b is in fact the smallest positive integer that can be written in the form ax + by.

Bézout's identity works not only in the ring of integers, but also in any other principal ideal domain (PID). That is, if R is a PID, and a and b are elements of R, and d is a greatest common divisor of a and b, then there are elements x and y in R such that ax + by = d. The reason: the ideal Ra+Rb is principal and indeed is equal to Rd.

To confirm: In some credible books, this identity has been attributed to French mathematician Claude Gaspard Bachet de Méziriac.

External link



Diophantine equations

Politics Business Finance
Bezout's Identity Greatest Common Divisor Integers

Topics: Bezout's Identity Greatest Common Divisor Integers Determined...

Bézout's identityIn number theory, Bezout's identity named after Etienne Bezout, is a linear diophantine equation. It states that if a and b are integers with greatest common divisor d then there exist integers x and y such that ax + by d''. Numbers x and y as above can bBézout's theoremIn mathematics, Bezout's theorem counts the number of intersections of two curves. It gives a number that is subject to 'interpretation'; but in any case is a maximum number of intersections that two algebraic curves can have, without having a common comp 


Non User