Question

Assume that a and b are positive integers and that c is an integer. Prove that there exist integers x and y
satisfying the equation
ax + by = c
if and only if gcd(a, b) divides c. (Hint: one direction follows easily from B´ezout’s Theorem.)