Euclidean Algorithm/Examples/2190 and 465

Examples of Use of Euclidean Algorithm
The GCD of $2190$ and $465$ is found to be:


 * $\gcd \set {290, 465} = 15$

Hence $15$ can be expressed as an integer combination of $2190$ and $465$:


 * $15 = 33 \times 465 - 7 \times 2190$

Proof
Thus:
 * $\gcd \set {290, 465} = 15$

Then we have: