The Mathematician James T. Cross, on his work "Primitive Pythagorean Triples of Gaussian Integers", displayed a method for generating all Pythagorean triples in $\mathbb{Z}[i]$. Inspired by his work, I want to find all the gaussian integer solutions of the equation $X^2+2=Y^3$. In $\mathbb{Z}$, the only solution is $x=5,y=3$ or $x=-5,y=3$. A trivial solution in $\mathbb{Z}[i]$ is $x=i$, $y=1$. My question is:
Any other mathematician solved this problem any time before?
I don't see the way of working directly on $\Bbb Z+\Bbb Z[i]$. But the equation in this ring of Gaussian integers is equivalent to the following system of four unknowns in $\Bbb Z$ $$\begin{cases}x^2-y^2+2=z^3-3zw^2\\2xy=3z^2w-w^3\end{cases}$$ This allows us to find out some infinite sets of solutions. Making, for example, $z=w$ we have $$x^2-y^2+2=-2z^3\\2xy=2z^3$$ therefore $$x^2-y^2+2+2xy=0\qquad (1)$$ We have in $(1)$ the particular solutions $(x,y)=(\pm1,\mp1),(\pm1,\mp3),(\pm7,\mp3)$
From this one has for $X=x+yi$ and $Y=z+wi$ the solutions of the proposed equation in Gaussian integers $$(x,y,z,w)=(\pm1,\mp1,t,t),(\pm1,\mp3,t,t),(\pm7,\mp3,t,t)$$ where t is an arbitrary rational integer.