Gaussian integer

From testwiki
Jump to navigation Jump to search

English

Template:Wikipedia

Noun

Template:En-noun

  1. 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 [i], 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, R1, we have the factorizations
      2=(1+i)(1i),
      5=(1+2i)(12i),
      13=(2+3i)(23i),
      17=(1+4i)(14i),
      29=(2+5i)(25i),
      where all the Gaussian integer factors in brackets above are irreducible elements of the ring of Gaussian integers.

Hypernyms

Hyponyms

See also

Template:Cln Template:C