"fundamental theorem of arithmetic" meaning in All languages combined

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "fundamental theorem of arithmetic (uncountable)",
      "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": "Terms with Danish translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with German translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Mandarin translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Number theory",
          "orig": "en:Number theory",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "the theorem that states that every integer greater than one is uniquely expressible as a product of prime numbers, which is called its prime factorization"
      ],
      "id": "en-fundamental_theorem_of_arithmetic-en-noun-JE96kKQU",
      "links": [
        [
          "number theory",
          "number theory"
        ],
        [
          "theorem",
          "theorem"
        ],
        [
          "integer",
          "integer"
        ],
        [
          "prime number",
          "prime number"
        ],
        [
          "prime factorization",
          "prime factorization"
        ]
      ],
      "raw_glosses": [
        "(number theory) the theorem that states that every integer greater than one is uniquely expressible as a product of prime numbers, which is called its prime factorization"
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "mathematics",
        "number-theory",
        "sciences"
      ],
      "translations": [
        {
          "code": "cmn",
          "lang": "Chinese Mandarin",
          "sense": "theorem",
          "word": "算術基本定理"
        },
        {
          "code": "cmn",
          "lang": "Chinese Mandarin",
          "roman": "suànshù jīběn dìnglǐ",
          "sense": "theorem",
          "word": "算术基本定理"
        },
        {
          "code": "da",
          "lang": "Danish",
          "sense": "theorem",
          "word": "aritmetikkens fundamentalsætning"
        },
        {
          "code": "de",
          "lang": "German",
          "sense": "theorem",
          "word": "Fundamentalsatz der Arithmetik"
        }
      ],
      "wikipedia": [
        "fundamental theorem of arithmetic"
      ]
    }
  ],
  "word": "fundamental theorem of arithmetic"
}

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "fundamental theorem of arithmetic (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Terms with Danish translations",
        "Terms with German translations",
        "Terms with Mandarin translations",
        "en:Number theory"
      ],
      "glosses": [
        "the theorem that states that every integer greater than one is uniquely expressible as a product of prime numbers, which is called its prime factorization"
      ],
      "links": [
        [
          "number theory",
          "number theory"
        ],
        [
          "theorem",
          "theorem"
        ],
        [
          "integer",
          "integer"
        ],
        [
          "prime number",
          "prime number"
        ],
        [
          "prime factorization",
          "prime factorization"
        ]
      ],
      "raw_glosses": [
        "(number theory) the theorem that states that every integer greater than one is uniquely expressible as a product of prime numbers, which is called its prime factorization"
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "mathematics",
        "number-theory",
        "sciences"
      ],
      "wikipedia": [
        "fundamental theorem of arithmetic"
      ]
    }
  ],
  "translations": [
    {
      "code": "cmn",
      "lang": "Chinese Mandarin",
      "sense": "theorem",
      "word": "算術基本定理"
    },
    {
      "code": "cmn",
      "lang": "Chinese Mandarin",
      "roman": "suànshù jīběn dìnglǐ",
      "sense": "theorem",
      "word": "算术基本定理"
    },
    {
      "code": "da",
      "lang": "Danish",
      "sense": "theorem",
      "word": "aritmetikkens fundamentalsætning"
    },
    {
      "code": "de",
      "lang": "German",
      "sense": "theorem",
      "word": "Fundamentalsatz der Arithmetik"
    }
  ],
  "word": "fundamental theorem of arithmetic"
}