"Chinese remainder theorem" meaning in English

{
  "etymology_text": "The earliest known statement of the theorem was by the Chinese mathematician Sun-tzu in the 3rd century AD.",
  "forms": [
    {
      "form": "the Chinese remainder theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Chinese remainder theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Number theory",
          "orig": "en:Number theory",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A theorem stating that, if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime."
      ],
      "id": "en-Chinese_remainder_theorem-en-name-fb2CNH3X",
      "links": [
        [
          "number theory",
          "number theory"
        ],
        [
          "remainder",
          "remainder"
        ],
        [
          "Euclidean division",
          "Euclidean division"
        ],
        [
          "integer",
          "integer"
        ],
        [
          "product",
          "product"
        ],
        [
          "divisor",
          "divisor"
        ],
        [
          "pairwise",
          "pairwise"
        ],
        [
          "coprime",
          "coprime"
        ]
      ],
      "raw_glosses": [
        "(number theory) A theorem stating that, if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime."
      ],
      "topics": [
        "mathematics",
        "number-theory",
        "sciences"
      ],
      "wikipedia": [
        "Chinese remainder theorem"
      ]
    }
  ],
  "word": "Chinese remainder theorem"
}

{
  "etymology_text": "The earliest known statement of the theorem was by the Chinese mathematician Sun-tzu in the 3rd century AD.",
  "forms": [
    {
      "form": "the Chinese remainder theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Chinese remainder theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "en:Number theory"
      ],
      "glosses": [
        "A theorem stating that, if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime."
      ],
      "links": [
        [
          "number theory",
          "number theory"
        ],
        [
          "remainder",
          "remainder"
        ],
        [
          "Euclidean division",
          "Euclidean division"
        ],
        [
          "integer",
          "integer"
        ],
        [
          "product",
          "product"
        ],
        [
          "divisor",
          "divisor"
        ],
        [
          "pairwise",
          "pairwise"
        ],
        [
          "coprime",
          "coprime"
        ]
      ],
      "raw_glosses": [
        "(number theory) A theorem stating that, if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime."
      ],
      "topics": [
        "mathematics",
        "number-theory",
        "sciences"
      ],
      "wikipedia": [
        "Chinese remainder theorem"
      ]
    }
  ],
  "word": "Chinese remainder theorem"
}