🏗️ ΘρϵηΠατπ🚧 (under construction)

Linear Diophantine Equation
A linear diophantine equation is an equation of the form ax+by=c where a,b,cZ

Note that while we know that there are infinitely many solutions to the above equation if we're seaching in R2 but it's not clear if there is even one solution when we restrict x,yZ

A Linear Diophantine Equation Has Solutions if the GCD of the coefficients divides the Constant
ax+by=c has solutions if and only if gcd(a,b)c
One Solution Yields Infinitely Many
Suppose that ax0+by0=c is a solution and d:=gcd(a,b) , then the entire set of solutions is given by: S:={(x0,y0)+t(bd,ad):tZ}
The Set of Linear Combinations Are All Integral Multiples of Their GCD
For any a,bZ the set S:={ax+by:x,yZ} is precisely the set of all integral multiples of gcd(a,b)