Prove that the Diophantine equation $ax+by=c$ has no integer solutions if $\gcd(a,b)$ does not divide $c$ there was a hint which is use use contradiction.
2026-03-30 08:59:35.1774861175
Prove that the Diophantine equation $ax+by=c$ has no integer solutions if $\gcd(a,b)$ does not divide $c$
481 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
If $d=gcd(a,b)$ then $d|a$ and $d|b$, whence $d|(ax+by)$, so it must be that $d|c$. Now take the contraposition.