{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "057H72B2MB"
    }
  ],
  "body": "\n## Definition\n\nLet $n$ be a natural number.\nA composition of $n$ is a finite sequence $(a_1, \\dots, a_k)$ of positive integers with $a_1 + \\dots + a_k = n$.\nThe number $k$ is the number of parts of the composition.\n\n## Remarks\n\nUnlike a [[partition|0404R9P9J3]], a composition records the order of its parts.\nThe compositions of $3$ are $(3)$, $(2, 1)$, $(1, 2)$ and $(1, 1, 1)$.\nThe number $0$ has exactly one composition, the empty sequence.\n\n## Explanations\n\n### L1 human\n\nA composition of $n$ writes $n$ as an ordered sum of positive integers.\nSo $2 + 1$ and $1 + 2$ are two different compositions of $3$.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "defines": "0P7FZHXZ5S",
    "kind": "definition",
    "msc": [
      "05A17"
    ],
    "name": "Composition of an integer",
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Composition_(combinatorics)"
      }
    ],
    "tag": "0J8ANSYKAC"
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/0J8ANSYKAC/",
  "links": [
    {
      "field": "defines",
      "target": "0P7FZHXZ5S"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0J8ANSYKAC.md",
  "msc": [
    "05A17"
  ],
  "name": "Composition of an integer",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0J8/0J8ANSYKAC.md",
  "status": null,
  "tag": "0J8ANSYKAC",
  "uri": "m2://0J8ANSYKAC",
  "url": "https://math2.tamnd.com/wiki/composition-of-an-integer-definition/",
  "writing": {
    "tag": "0J8ANSYKAC",
    "kind": "definition",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}