Prove that the Diophantine equation $ax+by=c$ has no integer solutions if $\gcd(a,b)$ does not divide $c$

481 Views Asked by At

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.

2

There are 2 best solutions below

0
On

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.

0
On

$$\gcd(a,b)\mid ax+by=c,$$ if there exists integral solution $(x,y)$.