Euclidean Algorithm/Examples/129 and 301

Examples of Use of Euclidean Algorithm
The GCD of $129$ and $301$ is found to be:


 * $\gcd \set {129, 301} = 43$

Hence $43$ can be expressed as an integer combination of $129$ and $301$:


 * $43 = 1 \times 301 - 2 \times 129$

Proof
Thus:
 * $\gcd \set {129, 301} = 43$

Then we have: