Metraipolis › archive › dc_51f7b3fe1998
Composition (combinatorics) — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Composition_(combinatorics)
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T22:54:52.874Z
- SHA-256 of the archived text
f8a31e742e371eed48867988e5ddff5a81fbe617747200c2153d6290f5a20f08- Stable URL of this page
https://metraipolis.com/documento/dc_51f7b3fe1998
How to cite
Composition (combinatorics) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Composition_(combinatorics) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_51f7b3fe1998 (Metraipolis archive dc_51f7b3fe1998, sha256 f8a31e742e371eed48867988e5ddff5a81fbe617747200c2153d6290f5a20f08)
BibTeX
@misc{dc51f7b3fe1998,
title = {Composition (combinatorics) — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Composition_(combinatorics)},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_51f7b3fe1998; sha256 f8a31e742e371eed48867988e5ddff5a81fbe617747200c2153d6290f5a20f08},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Composition_(combinatorics). Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In mathematics, a composition of an integer n is a way of writing n as the sum of a sequence of positive integers. Two sequences that differ in the order of their terms define different compositions of their sum, while they are considered to define the same integer partition of that number. Every integer has finitely many distinct compositions. Negative numbers do not have any compositions, but 0 has one composition, the empty sequence. Each positive integer n has 2n−1 distinct compositions. A weak composition of an integer n is similar to a composition of n, but allowing terms of the sequence to be zero: it is a way of writing n as the sum of a sequence of non-negative integers. As a consequence every positive integer admits infinitely many weak compositions (if their length is not bounded). Adding a number of terms 0 to the end of a weak composition is usually not considered to define a different weak composition; in other words, weak compositions are assumed to be implicitly extended indefinitely by terms 0. To further generalize, an A-restricted composition of an integer n, for a subset A of the (nonnegative or positive) integers, is an ordered collection of one or more elements in A whose sum is n. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «number theory»). Fonte: Wikipedia in inglese, voce «Composition (combinatorics)» — https://en.wikipedia.org/wiki/Composition_(combinatorics) Wikidata Q3302331 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3302331 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Composition_(combinatorics)?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1354923617, consultata il 2026-10-07T22:31:36.690Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 117e740013259e15a26d1195c6b58db6ecbb0c18278931e2f5b7a120537b87ef