Friday, 24 October 2025

Exercise (1.4).11

Prove that $ax + by= 1$ has integer solutions if and only if $\gcd (a, b) = 1$. 


We'll use Proposition (1.17)

The Diophantine equation $ax + by= c$ has integer solutions if and only if $\gcd (a, b) \mid c$.


Proposition 1.17 with $c=1$ is the proposition we want to prove.