Composition (number Theory) - Number of Compositions

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

 \big(\, \overbrace{1\, \square\, 1\, \square\, \ldots\, \square\, 1\, \square\, 1}^n\, \big)

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:

    “My tendency to nervousness in my younger days, in view of the fact of a number of near relatives on both my father’s and mother’s side of the house having become insane, gave some serious uneasiness. I made up my mind to overcome it.... In the cross-examination of witnesses before a crowded court-house ... I soon found I could control myself even in the worst of testing cases. Finally, in battle.”
    —Rutherford Birchard Hayes (1822–1893)

    “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)