# Numbers, Partition Of

**NUMBERS, PARTITION OF**. This mathematical subject, created by Euler, though relating essentially to positive integer numbers, is scarcely
regarded as a part of the Theory of Numbers (see NUMBER). We consider in it a number as made up by the addition of other numbers: thus the partitions of the
successive numbers i, 2, 3, 4, 5, 6, etc., are as follows:

i; 2, n; 3, 21, "i; 4, 31, 22, 211, mi; 5, 41, 32, 311, 221, 21 1 1, inn; 6, 51, 42, 411, 33, 321, 3III, 222, 2211, 21111, IIIIII.

These are formed each from the preceding ones; thus, to form the partitions of 6 we take first 6; secondly, 5 prefixed to each of the partitions of i (that is, 51); thirdly, 4 prefixed to each of the partitions of 2 (that is, 42, 411); fourthly, 3 prefixed to each of the partitions of 3 (that is, 33, 321, 3111); fifthly, 2 prefixed, not to each of the partitions of 4, but only to those partitions which begin with a number not exceeding 2 (that is, 222, 2211, 21111); and lastly, i prefixed to all the partitions of 5 which begin with a number not exceeding i (that is, HI HI); and so in other cases.

The method gives all the partitions of a number, but we may consider different classes of partitions: the partitions into a given number of parts, or into not more than a given number of parts; or the partitions into given parts, either with repetitions or without repetitions, etc. It is possible, for any particular class of partitions, to obtain methods more or less easy for the formation of the partitions either of a given xix, i& number or of the successive numbers i, 2, 3, etc. And of course in any case, having obtained the partitions, we can count them and so obtain the number of partitions.

Another method is by L. F. A. Arbogast's rule of the last and the last but one; in fact, taking the value of a to be unity, and, understanding this letter in each term, the rule gives b; c, b*; d, be, b 3 ; e, bd, c 2 , We, b*, etc., which, if b, c, d, e, etc., denote i, 2, 3, 4, etc., respectively, are the partitions of i, 2, 3, 4, etc., respectively.

An important notion is that of conjugate partitions.

Thus a partition of 6 is 42; writing this in the form j I] IX > and summing the columns instead of the lines, we obtain the conjugate partition 2211; evidently, starting from 2211, the conjugate partition is 42. If we form all the partitions of 6 into not more than three parts, these are 6, 51, 42, 33. 4"- 321, 222, and the conjugates are IIIIII, 2IIII, 2211, 222, 3III, 321, 33, where no part is greater than 3; and so in general we have the theorem, the number of partitions of n into not more than k parts is equal to the number of partitions of n with no part greater than k.

We have for the number of partitions an analytical theory depending on generating functions; thus for the partitions of a number n with the parts i, 2, 3, 4, 5, etc., without repetitions, writing down the product I +x. i +* ! . I +x*. i +x* . . . , = I +x+x*+2x*. ..+Nx*+. . . , it is clear that, if x, xP, *T, . . . are terms of the series *, x*, x*,. . . for which a+/)+y+ . . n, then we have in the development of the product a term x", and hence that in the term NX* of the product the coefficient N is equal to the number of partitions of with the parts I, 2, _3, . . . , without repetitions; or say that the product is the generating function (G. F.) for the number of such partitions. And so in other cases we obtain a generating function.

Thus for the function "l+X+2X*+..+Nx* +..., observing that any factor l/i x' is = \-\-x t + **'+. . . , we see that in the term NX* the coefficient is equal to the number of partitions of n, with the parts I, 2, 3, . . , with repetitions. Introducing another letter z, and considering the function we see that in the term JVx"z* of the development the coefficient ff is equal to the number of partitions of n into k parts, with the parts I, 2, 3, 4, . . . , without repetitions. And similarly, considering the function we see that in the term Nx* of the development the coefficient N is equal to the number of partitions of n into k parts, with the parts I, 2, 3, 4, . . . , with repetitions. We have such analytical formulae as i x 3 z. .

= . i _ ^ I X . l-X 1 which lead to theorems in the partition of numbers. A remarkable theorem is I -x. i -x*. i -x'. i -x*. = I -x-x t +x t +x'-x a -x" + . . . , where the only terms are those with an exponent iCS"**"). and for each such pair of terms the coefficient is (-)"!. The formula shows that except for numbers of the form i(3n*) the number of partitions without repetitions into an odd number of parts is equal to the number of partitions without repetitions into an even number of parts, whereas for the excepted numbers these numbers differ by unity. Thus for the number n, which is not an excepted number, the two sets of partitions are n, 821, 731, 641, 632, 542 10.1,92, 83, 74, 65, 5321, in each set 6. We have or, as this may be written, .=7^. = I +*+*+**+..., showing that a number n can always be made up, and in on way only, with the parts i, 2, 4, 8, . . . The product on the lef. -hand side may be taken to k terms only, thus if = 4, we have that is, any number from I to 15 can be made up, and in one way only, with the parts I, 2, 4, 8; and similarly any number from I to 2*-l can be made up, and in one way only, with the parts I, 2, 4, . . 2*~'. A like formula is i-x i-x* i-x" i-* 81 i-* 81 x. i * ' x 3 . i x 3 ' x* . i x" x" .i x x w .ix' that is, showing that any number from 40 to +40 can be made up, and that in one way only, with the parts i, 3, 9, 27 taken positively or negatively; and so in general any number from ^-Jfo*-!) to +?(3*~i) can be made up. and that in one way only, with the parts i. 3. 9i 3*~' taken positively or negatively. See further COMBINATORIAL ANALYSIS. (A. CA.)

*Note - this article incorporates content from Encyclopaedia Britannica, Eleventh Edition, (1910-1911)*