I'm trying to find a method to find the set of solutions in non zero integers for this diophantine equation. I thought of using a generalized formula of the solutions of $ax +by = c$ but i don't know what is the best way to approach it. Any help is appreciated. Thanks in advance! EDIT: the solutions should be in terms of a,b,d regarding them as constants
With $A=ab, C=c$ and $D=de$ we have the solutions $A=C(D+1)-1$ for arbitrary non-zero integers $C$ and $D$. For any $A$, we can find all ways to write it as a product $A=ab$, e.g., by computing the prime factorisation of $A$. For, say, $C=D=5$ we obtain $A=29$, which we can only write as $1\cdot 29$, or $29\cdot 1$ up to sign.