How would I go about proving this: Prove that if a, b, x, y are integers with ax + by = gcd(a, b) then gcd(x,y)= 1
Prove that if a, b, x, y are integers with ax + by = gcd(a, b) then gcd(x,y)= 1
0
$\begingroup$
euclidean-geometry
divisibility