Exercise
Let a and b be positive integers. The extended Euclidean algorithm provides us with x and y such that gcd(a,b) = xa + yb. Then gcd(|x|,|y|) equals
1
gcd(a,b)
0
Indeed, this is correct
No, dividing the equation by gcd(a,b)
leads to an equation of the form 1 = xa' + yb'
No, a gcd is always positive