The greatest common divisor of two or more integers is the largest integer that divides all of them (if it exists).

The greatest common divisor of two or more integers is the largest integer that divides all of them (if it exists). It may be computed using the Euclidean algorithm.

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

history | excerpt history