{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "0BKJT6WG96"
    },
    {
      "field": "uses",
      "target": "0KH1N66QWW"
    },
    {
      "field": "uses",
      "target": "0YEW47VJ0J"
    }
  ],
  "body": "\n## Definition\n\nLet $n$ be a positive integer.\nThe set of divisors of $n$ is the set of positive integers $d$ that [[divide|096PW7Q014]] $n$:\n$$D(n) = \\{ d \\in \\mathbb{Z}_{\u003e0} : d \\mid n \\}.$$\n\n## Remarks\n\nThe set $D(n)$ is finite, because each $d \\in D(n)$ satisfies $1 \\le d \\le n$. It always contains $1$ and $n$.\nFor example, $D(12) = \\{1, 2, 3, 4, 6, 12\\}$.\nThe map $d \\mapsto n/d$ is a bijection from $D(n)$ to itself.\nSums over $D(n)$ define the [[divisor function|0YEW47VJ0J]] and the [[Dirichlet convolution|0KH1N66QWW]].\n\n## Explanations\n\n### L1 human\n\nThe divisors of $n$ are the numbers that go into $n$ with no remainder.\nThey come in pairs $d$ and $n/d$. For $n = 12$, the pairs are $1$ and $12$, $2$ and $6$, and $3$ and $4$.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "defines": "0F4JSQE2EK",
    "kind": "definition",
    "msc": [
      "11A05"
    ],
    "name": "Divisors of a natural number",
    "sources": [
      {
        "locator": "Definition",
        "url": "https://en.wikipedia.org/wiki/Divisor"
      }
    ],
    "tag": "0FCWA16FZE",
    "uses": [
      "096PW7Q014"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/0FCWA16FZE/",
  "links": [
    {
      "field": "defines",
      "target": "0F4JSQE2EK"
    },
    {
      "field": "uses",
      "target": "096PW7Q014"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0FCWA16FZE.md",
  "msc": [
    "11A05"
  ],
  "name": "Divisors of a natural number",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0FC/0FCWA16FZE.md",
  "status": null,
  "tag": "0FCWA16FZE",
  "uri": "m2://0FCWA16FZE",
  "url": "https://math2.tamnd.com/wiki/divisors-of-a-natural-number-definition/",
  "writing": {
    "tag": "0FCWA16FZE",
    "kind": "definition",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}