{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "092GEF38YD"
    }
  ],
  "body": "\n## Summary\n\nThe binomial coefficient $\\binom{n}{k}$ is the number of ways to choose $k$ elements from an $n$-element set. These numbers are the coefficients in the expansion of $(x + y)^n$. The node [[binomial coefficient|092GEF38YD]] gives the precise definition.\n",
  "commit": "545acf83a9b75c8ddc375ef8b23d2ae101a4d7e4",
  "front": {
    "kind": "concept",
    "msc": [
      "05A10"
    ],
    "name": "Binomial coefficient",
    "same_as": {
      "wikidata": "Q209875",
      "wikipedia": "Binomial coefficient"
    },
    "sources": [
      {
        "locator": "Definition and interpretations",
        "url": "https://en.wikipedia.org/wiki/Binomial_coefficient"
      }
    ],
    "tag": "0GBZM0MT0F"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/0GBZM0MT0F/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0GBZM0MT0F.md",
  "msc": [
    "05A10"
  ],
  "name": "Binomial coefficient",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0GB/0GBZM0MT0F.md",
  "status": null,
  "tag": "0GBZM0MT0F",
  "uri": "m2://0GBZM0MT0F",
  "url": "https://math2.tamnd.com/wiki/binomial-coefficient/",
  "writing": {
    "tag": "0GBZM0MT0F",
    "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
      }
    ]
  }
}