Gaussian integer
Jump to navigation
Jump to search
English
Noun
- Template:Lb Any complex number of the form a + bi, where a and b are integers.
- Template:Quote-book
- 2000, André Weilert, Asymptotically fast GCD Computation in , Wieb Bosma (editor), Algorithmic Number Theory: 4th International Symposium, ANTS-IV, Proceedings, Springer, Template:W 1838, page 595,
- We present an asymptotically fast algorithm for the computation of the greatest common divisor (GCD) of two Gaussian integers.
- 2008, Timothy Gowers, June Barrow-Green, Imre Leader (editors), The Princeton Companion to Mathematics, Template:W, page 319,
- For example, in the ring of Gaussian integers, , we have the factorizations
- ,
- ,
- ,
- ,
- ,
- where all the Gaussian integer factors in brackets above are irreducible elements of the ring of Gaussian integers.
- For example, in the ring of Gaussian integers, , we have the factorizations