Bézout's Lemma

Revision as of 13:43, 19 February 2023 by Etmetalakret (talk | contribs) (WIP)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

In number theory, Bézout's Lemma, also called Bézout's Identity, states that for any integers $a$ and $b$ with greatest common denominator $d$, there exist integers $x$ and $y$ such that $ax + by  = d$. Furthermore, the integers of the form $ax + by$ are exactly the multiples of $d$. Bézout's Lemma is a foundational result in number theory that implies many other theorems, such as Euclid's Lemma and the Chinese Remainder Theorem.

To see an example of Bézout's Lemma, let $a$ and $b$ be $15$ and $6$ respectively. Note that $\gcd (a, b) = 3$, The Lemma thus states that there exist integers $x$ and $y$ such that $15x + 6y = 3$. A solution $(x, y)$ to this equation is $(1, -2)$.

(Note: This article is a work in progress! I don't believe AoPS has sandboxes, sadly. This should eventually replace Bezout's Lemma as the main article).