{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "02WF878BH1"
    }
  ],
  "body": "\n## Summary\n\nThe greatest common divisor of two integers is the largest integer that divides both of them.\nWe write it as $\\gcd(a, b)$.\nThe [[definition of the greatest common divisor|02WF878BH1]] gives the precise form and the convention for $\\gcd(0, 0)$.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "11A05"
    ],
    "name": "Greatest common divisor",
    "same_as": {
      "wikidata": "Q131752",
      "wikipedia": "Greatest common divisor"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Greatest_common_divisor"
      }
    ],
    "tag": "0C8WYW4KYQ"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0C8WYW4KYQ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0C8WYW4KYQ.md",
  "msc": [
    "11A05"
  ],
  "name": "Greatest common divisor",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0C8/0C8WYW4KYQ.md",
  "status": null,
  "tag": "0C8WYW4KYQ",
  "uri": "m2://0C8WYW4KYQ",
  "url": "https://math2.tamnd.com/wiki/greatest-common-divisor/",
  "writing": {
    "tag": "0C8WYW4KYQ",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}