Question

k

Answer 1

if you can use bezout, you get it in one step
\(gdc(a,b)=1\iff \) there exists \(x, y\) such that \(ax+by=1\)
if you cannot use bezout, look up a proof, it uses the euclidean algorithm