Euclidean algorithm (Z)/Gcd/3146 and 1515/Representation/Exercise

Determine in ${}\mathbb {Z}$, using the Euclidean algorithm, the greatest common divisor of ${}3146$ and ${}1515$. Find also a representation of the greatest common divisor as a linear combination with these numbers.

Create a solution