I have questions along the line of
Use the Euclidean Algorithm to find d= gcd(a,b) and x, y [itex]\in[/itex] [itex]Z[/itex] with d= ax +by
The Attempt at a Solution
Ok so I use the euclidean algorithm as I know it on say gcd (83,36), by minusing of the the lowest number and repeating until i get the last non zero remainder ie, the gcd but I am completely lost on how to find the form ax +by, I know there must be some technique other than guessing and trial and error....
anyone care to let me in?