# Definition:Bézout Numbers

Jump to navigation
Jump to search

## Definition

Let $a, b \in \Z$ such that $a \ne 0$ or $b \ne 0$.

Let $d$ be the greatest common divisor of $a$ and $b$.

- $\exists x, y \in \Z: a x + b y = d$

The numbers $x$ and $y$ are known as **Bézout numbers** of $a$ and $b$.

## Complete Set of Bézout Numbers

This page or section has statements made on it that ought to be extracted and proved in a Theorem page.In particular: Extract this into a Theorem pageYou can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by creating any appropriate Theorem pages that may be needed.To discuss this page in more detail, feel free to use the talk page. |

These numbers, are not unique for a given $a, b \in \Z$.

For a given $a, b \in \Z$ there is a countably infinite number of **Bézout numbers**.

From Solution of Linear Diophantine Equation, if $x_0$ and $y_0$ are **Bézout numbers**, then:

- $\ds \forall k \in \Z: x = x_0 + \frac {k b} {\gcd \set {a, b} }, y = y_0 - \frac {k a} {\gcd \set {a, b} }$

are also **Bézout numbers**.

## Also known as

**Bézout numbers** are also known as **Bézout coefficients**.

## Source of Name

This entry was named for Étienne Bézout.