Given integers a and b, prove the following:
(a) There exist integers x and y for which c = ax + by if and only if gcd (a, b)|c.
(b) If there exist integers x and y for which ax + by = gcd(a, b), then gcd(x, y) = 1.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.