{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0JZSRWRBZE"
    }
  ],
  "body": "\n## Summary\n\nA combination is a selection of elements of a set in which the order does not matter. Combinations of size $k$ are the $k$-element subsets, and binomial coefficients count them. The node [[combination|0JZSRWRBZE]] gives the precise definition.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "concept",
    "msc": [
      "05A05"
    ],
    "name": "Combination",
    "same_as": {
      "wikidata": "Q202805",
      "wikipedia": "Combination"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Combination"
      }
    ],
    "tag": "098PHYBTV9"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/098PHYBTV9/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/098PHYBTV9.md",
  "msc": [
    "05A05"
  ],
  "name": "Combination",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/098/098PHYBTV9.md",
  "status": null,
  "tag": "098PHYBTV9",
  "uri": "m2://098PHYBTV9",
  "url": "https://math2.tamnd.com/wiki/combination/",
  "writing": {
    "tag": "098PHYBTV9",
    "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
      }
    ]
  }
}