Divisibility and factorization · Definition

Bézout's identity

elementary number theorydivisibility and factorization

Before you start you need to know

This identity connects the greatest common divisor with integer linear combinations of two numbers. It is a central tool for solving linear Diophantine equations and proving divisibility properties.

Definition

Bézout's identity states that, for integers \( a \) and \( b \) not both zero, there exist integers \( x \) and \( y \) such that \( ax+by=\gcd(a,b) \).

\[ax+by=\gcd(a,b) \text{ for some } x,y\in\mathbb{Z}\]

If \( d=\gcd(a,b) \), the identity guarantees that \( d \) is the smallest positive integer of the form \( ax+by \). Moreover, every integer of that form is a multiple of \( d \), which follows directly from \( d \) dividing both \( a \) and \( b \).

For \( a=252 \) and \( b=198 \), the Euclidean algorithm gives \( \gcd=18 \). Working backward through the divisions yields \( 18=252\cdot 4-198\cdot 5 \), so \( x=4 \) and \( y=-5 \) is one solution.

A typical mistake is believing the identity requires \( x \) and \( y \) to be positive. The coefficients may be negative or zero, and this confusion leads to discarding valid combinations or wrongly claiming no solutions exist.

Think about it

Why can x and y be negative in the identity?

Because the identity only requires them to be integers, not positive.

Exercises 10

References

  • David M. Burton, Elementary Number Theory, 7th edition, McGraw-Hill, 2011. cap. 2
  • Ivan Niven, Herbert S. Zuckerman, Hugh L. Montgomery, An Introduction to the Theory of Numbers, 5th edition, Wiley, 1991. cap. 1