{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\n[[Pigeonhole principle|0HGVCWQGY3]]: If *$n$* items are put into *$m$* containers, with $n \u003e m$, then at least one container must contain more than one item. For example, of three gloves (none of which is ambidextrous/reversible), at least two must be right-handed or at least two must be left-handed, because there are three objects but only two categories of handedness to put them into.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "inventory": [
      "TWBTK3W5YT"
    ],
    "kind": "statement",
    "name": "Combinatorial laws",
    "role": "proposition",
    "sources": [
      {
        "locator": "Law (mathematics), section Notable examples \u003e Combinatorial laws",
        "mention": "wikipedia://en/77662984#OSSA",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:77662984@r1362840840"
      }
    ],
    "tag": "ADEGQQTXYY"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/ADEGQQTXYY/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/ADEGQQTXYY.md",
  "msc": null,
  "name": "Combinatorial laws",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/ADE/ADEGQQTXYY.md",
  "status": null,
  "tag": "ADEGQQTXYY",
  "uri": "m2://ADEGQQTXYY",
  "url": "https://math2.tamnd.com/wiki/combinatorial-laws/",
  "writing": {
    "tag": "ADEGQQTXYY",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}