If one solves the Diophantine equation $cx + by = a$; i.e., $cx = a - by = a \pmod{b}$ formally, then the answer is $x = (a/c) - (b/c)y$, but the integer character and information is lost and not easily recovered. However, the formula, which I have given at this question characterizes the countably infinite many solutions. Is there any mathematician to generalize this statement?
Diophantine equation
2
$\begingroup$
number-theory
diophantine-equations