Euclidean Algorithm/Examples/24 and 138/Integer Combination

Examples of Use of Euclidean Algorithm
$6$ can be expressed as an integer combination of $24$ and $138$:


 * $6 = 6 \times 24 - 1 \times 138$

Proof
From Euclidean Algorithm: $24$ and $138$ we have:

and so:
 * $\gcd \set {24, 138} = 6$

Then we have: