{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn [[combinatorics|0JKW7W7XFR]], the **rule of division** is a counting principle. It states that there are $n/d$ ways to do a task if it can be done using a procedure that can be carried out in $n$ ways, and for each way $w$, exactly $d$ of the $n$ ways correspond to the way $w$. In a nutshell, the division rule is a common way to ignore \"unimportant\" differences when counting things.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "1A2M8K6Q2J"
    ],
    "kind": "concept",
    "name": "Rule of division (combinatorics)",
    "same_as": {
      "wikidata": "Q96403087",
      "wikipedia": "Rule of division (combinatorics)"
    },
    "sources": [
      {
        "locator": "Rule of division (combinatorics)",
        "mention": "wikipedia://en/63848545",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:63848545@r1080065682"
      }
    ],
    "tag": "9VADDT7THK"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/9VADDT7THK/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/9VADDT7THK.md",
  "msc": null,
  "name": "Rule of division (combinatorics)",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/9VA/9VADDT7THK.md",
  "status": null,
  "tag": "9VADDT7THK",
  "uri": "m2://9VADDT7THK",
  "url": "https://math2.tamnd.com/wiki/rule-of-division-combinatorics/",
  "writing": {
    "tag": "9VADDT7THK",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "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
      }
    ]
  }
}