Diophantine linear Equation Gaussian Integers

452 Views Asked by At

We know that $ax+by=c$ with $gcd(a,b)=1$ could be solved over $\Bbb Z$. Supposing if $a,b,c\in\Bbb Z[i]$, is there an analogous framework to find $x,y\in\Bbb Z[i]$ (at least of minimum norms)?