"Gaussian integer" meaning in English

{
  "forms": [
    {
      "form": "Gaussian integers",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Gaussian integer (plural Gaussian integers)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Algebra",
          "orig": "en:Algebra",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Numbers",
          "orig": "en:Numbers",
          "parents": [
            "All topics",
            "Terms by semantic function",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1997, Bernard L. Johnston, Fred Richman, Numbers and Symmetry: An Introduction to Algebra, CRC Press, page 44:",
          "text": "We could say that a Gaussian integer is larger than another if its norm is larger, that is, if its distance from the origin is larger. That's all right, although it has the peculiarity that 5 is larger than -7 as an integer, but smaller than -7 as a Gaussian integer! In a way, this notion of larger makes more sense: shouldn't -7 be considered larger than 5?",
          "type": "quote"
        },
        {
          "text": "2000, André Weilert, Asymptotically fast GCD Computation in ℤ[i], Wieb Bosma (editor), Algorithmic Number Theory: 4th International Symposium, ANTS-IV, Proceedings, Springer, LNCS 1838, page 595,\nWe present an asymptotically fast algorithm for the computation of the greatest common divisor (GCD) of two Gaussian integers."
        },
        {
          "text": "2008, Timothy Gowers, June Barrow-Green, Imre Leader (editors), The Princeton Companion to Mathematics, Princeton University Press, page 319,\nFor example, in the ring of Gaussian integers, R_-1, we have the factorizations\n2=(1+i)(1-i),\n5=(1+2i)(1-2i),\n13=(2+3i)(2-3i),\n17=(1+4i)(1-4i),\n29=(2+5i)(2-5i),\n⋮\nwhere all the Gaussian integer factors in brackets above are irreducible elements of the ring of Gaussian integers."
        }
      ],
      "glosses": [
        "Any complex number of the form a + bi, where a and b are integers."
      ],
      "hypernyms": [
        {
          "word": "complex number"
        },
        {
          "word": "Gaussian rational number"
        },
        {
          "word": "Gaussian rational"
        },
        {
          "sense": "quadratic integer",
          "word": "algebraic integer"
        }
      ],
      "hyponyms": [
        {
          "word": "Gaussian prime"
        },
        {
          "word": "integer"
        }
      ],
      "id": "en-Gaussian_integer-en-noun-FqkK~9A7",
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "complex number",
          "complex number"
        ],
        [
          "integer",
          "integer"
        ]
      ],
      "raw_glosses": [
        "(algebra) Any complex number of the form a + bi, where a and b are integers."
      ],
      "related": [
        {
          "word": "Eisenstein integer"
        },
        {
          "word": "Blum integer"
        }
      ],
      "topics": [
        "algebra",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Gaussian integer"
      ]
    }
  ],
  "word": "Gaussian integer"
}

{
  "forms": [
    {
      "form": "Gaussian integers",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Gaussian integer (plural Gaussian integers)",
      "name": "en-noun"
    }
  ],
  "hypernyms": [
    {
      "word": "complex number"
    },
    {
      "sense": "quadratic integer",
      "word": "algebraic integer"
    },
    {
      "word": "Gaussian rational number"
    },
    {
      "word": "Gaussian rational"
    }
  ],
  "hyponyms": [
    {
      "word": "Gaussian prime"
    },
    {
      "word": "integer"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "Eisenstein integer"
    },
    {
      "word": "Blum integer"
    }
  ],
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Algebra",
        "en:Numbers"
      ],
      "examples": [
        {
          "ref": "1997, Bernard L. Johnston, Fred Richman, Numbers and Symmetry: An Introduction to Algebra, CRC Press, page 44:",
          "text": "We could say that a Gaussian integer is larger than another if its norm is larger, that is, if its distance from the origin is larger. That's all right, although it has the peculiarity that 5 is larger than -7 as an integer, but smaller than -7 as a Gaussian integer! In a way, this notion of larger makes more sense: shouldn't -7 be considered larger than 5?",
          "type": "quote"
        },
        {
          "text": "2000, André Weilert, Asymptotically fast GCD Computation in ℤ[i], Wieb Bosma (editor), Algorithmic Number Theory: 4th International Symposium, ANTS-IV, Proceedings, Springer, LNCS 1838, page 595,\nWe present an asymptotically fast algorithm for the computation of the greatest common divisor (GCD) of two Gaussian integers."
        },
        {
          "text": "2008, Timothy Gowers, June Barrow-Green, Imre Leader (editors), The Princeton Companion to Mathematics, Princeton University Press, page 319,\nFor example, in the ring of Gaussian integers, R_-1, we have the factorizations\n2=(1+i)(1-i),\n5=(1+2i)(1-2i),\n13=(2+3i)(2-3i),\n17=(1+4i)(1-4i),\n29=(2+5i)(2-5i),\n⋮\nwhere all the Gaussian integer factors in brackets above are irreducible elements of the ring of Gaussian integers."
        }
      ],
      "glosses": [
        "Any complex number of the form a + bi, where a and b are integers."
      ],
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "complex number",
          "complex number"
        ],
        [
          "integer",
          "integer"
        ]
      ],
      "raw_glosses": [
        "(algebra) Any complex number of the form a + bi, where a and b are integers."
      ],
      "topics": [
        "algebra",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Gaussian integer"
      ]
    }
  ],
  "word": "Gaussian integer"
}