Euclidean Algorithm/Examples/2145 and 1274

Examples of Use of Euclidean Algorithm
The GCD of $2145$ and $1274$ is:


 * $\gcd \set {2145, 1274} = 13$

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


 * $13 = 32 \times 1274 - 19 \times 2145$

Proof
Thus:
 * $\gcd \set {2145, 1274} = 13$

Then we have: