I know that in general, for two integers $a$ and $b$, there exist integers $x$ and $y$ such that \begin{equation} ax+by=gcd(a,b) \end{equation} In this case, let $a=6$ and $b=15$ and let the right-hand-side equal $2$. Do there exist any $x$ and $y$ so that \begin{equation} 6x+15y=2? \end{equation} Note that $2 \ne gcd(6,15)=3$. However, this is what my question comes down to: I know that there DO exist solutions $x$ and $y$ to \begin{equation} 6x+15y=3 \end{equation} However, as far as I know, $3$ isn't the ONLY right-hand-side for which this works, is it? In other words, is the greatest common divisor the only possible right-hand-side for which this works?
Thanks!
Since $6x + 15 y = 3(2x + 5y)$, the LHS will always be divisible by $3$. Therefor, there cannot be any solution unless the RHS is also divisible by $3$.
Assume now that this is the case, i.e., consider the equation $6x + 15y = k \gcd(6,15) = 3 k$, where $k$ is some integer. As you already have noticed, there exists integers $x_0$, $y_0$ such that $6x_0 + 15y_0 = 3$. Multiplying both sides by $k$ you obtain that $6(kx_0) + 15(ky_0) = 3 k$. That is, $x = kx_0$ and $y = ky_0$ is a solution to our equation.