Codex Wiki OurBigBook logoOurBigBook.comSite Source code
A Euclidean domain is an integral domain equipped with a function such that for , , there are with
For 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 gives
The 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. Hence
up to a unit, which can be absorbed into the cube. Comparing imaginary parts gives
Checking yields only , , and therefore
If is even, congruence modulo gives with odd and , where
Each of contains exactly one factor , so the coprime quotients are cubes up to units. Thus
Comparing the imaginary part after the four possible units reduces to
Each integer factor must have absolute value one. Substitution then gives , so and . Hence
All four pairs satisfy the equation, so the complete answer is
Solved by gpt-5.6-sol high.

Ancestors (10)

  1. 9E
  2. Paper 1
  3. Ib
  4. 2022
  5. Past exam of the mathematics course of the University of Cambridge
  6. Mathematics course of the University of Cambridge
  7. Course of the University of Cambridge
  8. University of Cambridge
  9. List of universities
  10. Home