# Integer Combination of Coprime Integers/Necessary Condition/Proof 1

Jump to navigation
Jump to search

## Theorem

Let $a, b \in \Z$ be integers, not both zero.

Let $a$ and $b$ be such that there exists an integer combination of them equal to $1$.

Then $a$ and $b$ are coprime:

- $\forall a, b \in \Z: \exists m, n \in \Z: m a + n b = 1 \implies a \perp b$

In such an integer combination $m a + n b = 1$, the integers $m$ and $n$ are also coprime.

## Proof

\(\ds \exists m, n \in \Z: \, \) | \(\ds m a + n b\) | \(=\) | \(\ds 1\) | |||||||||||

\(\ds \leadsto \ \ \) | \(\ds \gcd \set {a, b}\) | \(\divides\) | \(\ds 1\) | Set of Integer Combinations equals Set of Multiples of GCD | ||||||||||

\(\ds \leadsto \ \ \) | \(\ds \gcd \set {a, b}\) | \(=\) | \(\ds 1\) | |||||||||||

\(\ds \leadsto \ \ \) | \(\ds a\) | \(\perp\) | \(\ds b\) | Definition of Coprime Integers |

$\blacksquare$

## Also known as

This result is sometimes known as Bézout's Identity, although that result is usually used for the more general result for not necessarily coprime integers.

Some sources refer to this result as the Euclidean Algorithm, but the latter as generally understood is the procedure that can be used to establish the values of $m$ and $n$, and for any pair of integers, not necessarily coprime.

## Sources

- 1980: David M. Burton:
*Elementary Number Theory*(revised ed.) ... (previous) ... (next): Chapter $2$: Divisibility Theory in the Integers: $2.2$ The Greatest Common Divisor: Theorem $2 \text{-} 4$