The question that I am working is:
Given the following diophantine equation: $53x + 12y = 2$ determine the integer solutions (if any).
The problem that I am facing is that I tried to find two solutions but keep getting an incorrect $x_{0}$ and $y_{0}$ values.
Here is my work: Claim - "Yes, integer solutions do exists."
Using Euclid's Algorithm:
$53 = 12(4) + 5$
$12 = 5(2) + 2$
$5 = 2(2) + 1$
$1 = 1(1) + 0$
Hence, $\text{gcd}(53,12) = 1$
System of equations:
$1 = 2 - 1(1)$
$1 = 5 - 2(2)$
$2 = 12 - 5(2)$
$5 = 53 - 12(4)$
Solution of Linear Congruence says solution always exists as $2$ is divisible by $(12,53)=1$
$$53x+12y=2=12\cdot9-2\cdot53$$
$$\iff53(x+2)=12(9-y)\iff\dfrac{53(x+2)}{12}=9-y$$ which is an integer
$\implies12|53(x+2)\iff12|(x+2)$ as $(12,53)=1$
$\implies x=12m-2$ where $m$ is any integer
Put this in $53x+12y=2$