Composition (combinatorics)
In mathematics, a composition of an integer n is a way of writing n as the sum of a sequence of (strictly) 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 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.
- Comment
- enIn mathematics, a composition of an integer n is a way of writing n as the sum of a sequence of (strictly) 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 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.
- Depiction
- Has abstract
- enIn mathematics, a composition of an integer n is a way of writing n as the sum of a sequence of (strictly) 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 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.
- Hypernym
- Way
- Is primary topic of
- Composition (combinatorics)
- Label
- enComposition (combinatorics)
- Link from a Wikipage to an external page
- www.se16.info/js/partitions.htm
- Link from a Wikipage to another Wikipage
- Binomial coefficient
- Category:Combinatorics
- Category:Number theory
- Coefficient
- File:Binary and compositions 4.svg
- File:Compositions of 6.svg
- File:Fibonacci climbing stairs.svg
- File:Partitions of 6.svg
- File:Pascal triangle compositions.svg
- Homogeneous polynomial
- Integer
- Mathematics
- Non-negative integer
- Partition (number theory)
- Positive integer
- Stars and bars (combinatorics)
- Summation
- SameAs
- 33QJP
- Composition (combinatoire)
- Kompozicioni i numrit natyral
- m.02p3kj
- Q3302331
- Композиция числа
- Композиція (комбінаторика)
- Subject
- Category:Combinatorics
- Category:Number theory
- Thumbnail
- WasDerivedFrom
- Composition (combinatorics)?oldid=1074021834&ns=0
- WikiPageLength
- 6507
- Wikipage page ID
- 550741
- Wikipage revision ID
- 1074021834
- WikiPageUsesTemplate
- Template:Cite book
- Template:Other uses of
- Template:Reflist
