Let $a$ and $b$ be two numbers whose $\gcd{(a,b)}=ax+by$. How do I find $x$ and $y$?
I did it like this.
There is a $c$ which is a multiple of $\gcd{(a,b)}$ . Then $c=d \gcd{(a,b)}=d(ax+by)$ . Then I used this equation and the above most equation to find $x$ and $y$.
The thing is I have to write an algorithm and code it in c++ to find $x$ and $y$.