Let a and b be nonzero integers and c be an integer. Prove that the equation ax + by = c has an integer solution if and only if gcd(a, b) divides c.
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.