{
  "aliases": [
    "division-theorem-positive-integers"
  ],
  "backlinks": null,
  "body": "\n## Statement\n\nTake two positive integers $m$ and $n$.\nThen exactly one pair of integers $(q, r)$ satisfies both $m = qn + r$ and $0 \\le r \u003c n$.\n\n## Remarks\n\nThe integer $q$ is the quotient and $r$ is the remainder when $m$ is divided by $n$.\nThe remainder is $0$ exactly when $n$ [[divides|096PW7Q014]] $m$.\nFor example, with $m = 17$ and $n = 5$ we get $q = 3$ and $r = 2$, since $17 = 3 \\cdot 5 + 2$.\nThis is the case of the general division algorithm in which both numbers are positive.\n",
  "commit": "bdea0329dc328964ec62566e23a0159c6ce93f2d",
  "front": {
    "aliases": [
      "division-theorem-positive-integers"
    ],
    "kind": "statement",
    "msc": [
      "11A05"
    ],
    "name": "Division theorem for positive integers",
    "role": "theorem",
    "sources": [
      {
        "locator": "source/s_induction_recursion.ptx:163",
        "url": "https://github.com/mitchkeller/applied-combinatorics/blob/ebd95d6bd59e23c633c65cf560bcb93efa912aae/source/s_induction_recursion.ptx#L163"
      }
    ],
    "tag": "5DD48BF6CM",
    "uses": [
      "096PW7Q014"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/5DD48BF6CM/",
  "links": [
    {
      "field": "uses",
      "target": "096PW7Q014"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/5DD48BF6CM.md",
  "msc": [
    "11A05"
  ],
  "name": "Division theorem for positive integers",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/5DD/5DD48BF6CM.md",
  "status": null,
  "tag": "5DD48BF6CM",
  "uri": "m2://5DD48BF6CM",
  "url": "https://math2.tamnd.com/wiki/division-theorem-for-positive-integers/",
  "writing": {
    "tag": "5DD48BF6CM",
    "kind": "statement",
    "level": "W1",
    "next": [
      {
        "what": "edge about out",
        "note": "the concepts that the statement is about",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge proves in",
        "note": "at least one proof node",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of or illustrates in",
        "note": "one example that shows the statement at work",
        "have": 0,
        "want": 1
      },
      {
        "what": "explanation L2",
        "have": 0,
        "want": 1
      }
    ]
  }
}