Past exam of the mathematics course of the University of Cambridge / 2007 / ia / Paper 4 / 1E / i / Solution

The Euclidean algorithm givesBack-substitution supplies the Bezout identityThus one solution is $(x,y)=(-5,2)$. If $(x,y)$ is any solution, subtraction gives $7(x+5)+18(y-2)=0$. Since $7$ and $18$ are coprime, $18$ divides $x+5$. Write $x+5=18t$; substitution then gives $y-2=-7t$. Conversely these values satisfy the equation for every integer $t$. Hence all solutions are