{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0F7KNJ1ZYN"
    }
  ],
  "body": "\n## Summary\n\nA greatest common divisor of two elements of an integral domain is a common divisor that every common divisor divides.\nIt is unique up to associates when it exists.\nThe [[definition of a greatest common divisor|0F7KNJ1ZYN]] gives the conditions.\n",
  "commit": "f591989ed15704e9d8755a7a5a6426d73de7a3ae",
  "front": {
    "kind": "concept",
    "msc": [
      "13A05"
    ],
    "name": "Greatest common divisor in an integral domain",
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/GCD_domain"
      }
    ],
    "tag": "0ZAF9KHDDF"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0ZAF9KHDDF/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0ZAF9KHDDF.md",
  "msc": [
    "13A05"
  ],
  "name": "Greatest common divisor in an integral domain",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0ZA/0ZAF9KHDDF.md",
  "status": null,
  "tag": "0ZAF9KHDDF",
  "uri": "m2://0ZAF9KHDDF",
  "url": "https://math2.tamnd.com/wiki/greatest-common-divisor-in-an-integral-domain/",
  "writing": {
    "tag": "0ZAF9KHDDF",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}