{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0TH61JR04G"
    }
  ],
  "body": "\n## Summary\n\nA derangement is a permutation that moves every element. Derangements answer the classical hat-check problem, and their number is a standard application of inclusion and exclusion. The node [[derangement|0TH61JR04G]] gives the precise definition.\n",
  "commit": "545acf83a9b75c8ddc375ef8b23d2ae101a4d7e4",
  "front": {
    "kind": "concept",
    "msc": [
      "05A05"
    ],
    "name": "Derangement",
    "same_as": {
      "wikidata": "Q1207920",
      "wikipedia": "Derangement"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Derangement"
      }
    ],
    "tag": "0XHWTD3MPV"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0XHWTD3MPV/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0XHWTD3MPV.md",
  "msc": [
    "05A05"
  ],
  "name": "Derangement",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0XH/0XHWTD3MPV.md",
  "status": null,
  "tag": "0XHWTD3MPV",
  "uri": "m2://0XHWTD3MPV",
  "url": "https://math2.tamnd.com/wiki/derangement/",
  "writing": {
    "tag": "0XHWTD3MPV",
    "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
      }
    ]
  }
}