If two integers are relatively prime, then this value for those two integers is one.
Bézout's Identity means that for integers a and b, there exist integers u and v such that au plus bv equals this value for a and b. It can be computed using an algorithm that is based on the fact that this of a and b is equal to that of b and the (*) remainder of a divided by b. That algorithm is named for Euclid. If two integers are relatively prime, then this value for those two integers is one. For 10 points, name this value that is the largest factor shared by two numbers, which for the example of 12 and 18 is 6.
Bézout's Identity means that for integers a and b, there exist integers u and v such that au plus bv equals this value for a and b.
{greatest common divisor} [or {GCD}; or {greatest common denominator}; or {greatest common}