A Euclidean domain is an integral domain equipped with a function such that for , , there are withFor the Gaussian integers , take . Choosing a Gaussian integer nearest to makes the remainder norm smaller than .
The units are precisely the elements of norm one:Unique factorization in this Euclidean domain givesThe displayed factors have prime norms or , so they are irreducible; factors appearing together are nonassociate.
Now suppose . Necessarily . First let be odd. Then is odd, and and are coprime in : a common Gaussian prime would divide , while their product has odd norm. Henceup to a unit, which can be absorbed into the cube. Comparing imaginary parts givesChecking yields only , , and therefore
If is even, congruence modulo gives with odd and , whereEach of contains exactly one factor , so the coprime quotients are cubes up to units. ThusComparing the imaginary part after the four possible units reduces toEach integer factor must have absolute value one. Substitution then gives , so and . HenceAll four pairs satisfy the equation, so the complete answer is
Solved by gpt-5.6-sol high.
Codex Wiki