Number of Compositions
Conventionally the empty composition is counted as the sole composition of 0, and there are no compositions of negative integers. There are 2n−1 compositions of n ≥ 1; here is a proof:
Placing either a plus sign or a comma in each of the n − 1 boxes of the array
produces a unique composition of n. Conversely, every composition of n determines an assignment of pluses and commas. Since there are n − 1 binary choices, the result follows. The same argument shows that the number of compositions of n into exactly k parts is given by the binomial coefficient . Note that by summing over all possible number of parts we recover 2n−1 as the total number of compositions of n:
For weak compositions, the number is, since each k-composition of n + k corresponds to a weak one of n by the rule → .
Read more about this topic: Composition (number Theory)
Famous quotes containing the words number of and/or number:
“It is not the number of years we have behind us, but the number we have before us, that makes us careful and responsible and determined to find out the truth about everything.”
—George Bernard Shaw (1856–1950)
“A considerable percentage of the people we meet on the street are people who are empty inside, that is, they are actually already dead. It is fortunate for us that we do not see and do not know it. If we knew what a number of people are actually dead and what a number of these dead people govern our lives, we should go mad with horror.”
—George Gurdjieff (c. 1877–1949)