II .
The Doctrine of Combinations and Alternations , Improved and Completed , by Major Edward Thornycrost .
IN order to understand what follows , it must be observed , 1st , That as in the notation of Powers , aaa a bbbcc is designed by a4 b3 c2 , and universally p times the position of a , q times the position of b , r times the position of c , by ap bp c~ , so in things exposed likewise : ( unless where it is proposed they should be all different ) which Indices , as they have here no relation to Powers , but express only the Occurrences of those things to which they respectively belong ; I therefore call Indices of Occurrences .
2dly , That as often as I shall hereafter mention the Combinations or Alternations of the ps qs rs or ss , ( which considered by themselves are capable of no variation ) I mean of those things whose Indices they are .
3dly , That m is generally put for the whole number of things exposed , whether all different or not , i. e. equal to the sum of their Indices ; and n , for such a number of them , as each Combination and Alternation must consist of ; ( unless presupposed equal ) which explains what is hereafter meant by the Combinations and Alternations of m things taken n and n ; or of m things taken m and m ; and the like Expression , by whatever Symbols the number of things out of which the Combinations and Alternations are to be made , or of which they are to consist , may be designed .
Aaaaaaaaaaa Lemm a Lemma 1st .
If in a right Line , at any distances , be placed any number of things , ab cd , &amp;c. the number of the Intervals ab , bc , cd , &amp;c. terminated each by two adjacent things , is one less than the number of things .
For , whereas every Interval is terminated by two adjacent things , if to any number of things , be added one thing more , one Interval only is thereby added .
Q.E.D. Lemma 2d .
The number of the Alternations of m things abed , &amp;c. different each from other , taken m and m , is m times the number of the Alternations of m-1 things abc , taken m-1 and m-1 .
For , ( by Lem .
1st ) the last Letter d , besides the position it hath , may have m-2 positions , viz. in the Intervals which are between m-1 things abc ; but it may also have one more , for it may be put first of all , it may therefore have m positions ; and those in all the different Orders , whereof m-1 things are capable ; which being all the possible positions of d , in all the varieties of abc , is all the variety whereof the whole number of things exposed abed , &amp;c. is capable .
Q.E.D. Lemma 3d .
The number of the Alternations of m things abed , &amp;c. different each from other , taken m and m , is equal to mx m-1 xm m-2 x m-3 x m-4 , &amp;c. continued to m places .
For let mO , express the number of the Alternations of m things different each from other ; m-1 O , of m-1 things and the like .
It is evident that if m= 1 , It will be mO= m ; for there can be but one order of one thing .
And if m be greater than unity , then will it be(by Lem.2 ) mO=mx m-1 O=mx m-1 x m-2 O=mx m-1 x m-2 x m-3 O = , &amp;c. till we have an Equation consisting of m places ; i. e. =mx m-1 x m-2 x m-3 x &amp;c. continued to m places .
Q : E D. Lemma 4th .
If m~ Express the number of the Alternations of m things ap bp Cp dq eq fr &amp;c. taken m and m , and ~ the number of ps , ~ the number of qs , ~ the number of r~ , it will be m~= mxm-1 x m-2 x m-3 x m-4 x m-5 x &amp;c. continued to m places .
/ px p-1 x p-2 x &amp;c. ~xqx q-1 x &amp;c. ~xrx r-1 x &amp;c. ~ each Series continued to p , q , r , &amp;c. places respectively .
For the number of the Alternations of any number of things , however divided into parts , is produced by a continual Multiplication of the Alternations of those things amongstthemselves respectively , which compose each part , into the number of their Alternations one amongst the other ; i. e. in the present case ( the several occurrences being supposed to compose the several parts , and consequently the number of the Alternations of the things composing each part equal to unity ) m~= to the number of the Alternations of the things composing the parts one amongst the other ; but the number of their Alternations one amongst the other , is the same in this case , as if the things exposed , being all different , were divided into the same parts ; for the things which compose each part in both cases , are different from the rest of the things exposed ; i. e. by Lem .
3d .
m~=mx m-1 x m-2 x m-3 x m-4 x m-5 x &amp; c continued to m places .
/ p x p-1 x p-2 x &amp;c. ~xqx q-1 x &amp;c. ~xrx r-1 x &amp;c. ~ each Series continued to p , q , r places respectively .
Q. E. D. Lemma 5th .
The number of the Combinations of m things abc d , &amp;c. different each from other , taken n and n , is equal to mx m-1 x m-2 x m-3 x &amp;c. / n x n-1 x n-2 x n-3 each Series continued to n places For if the things exposed be divided in two parts , viz. in the ratio of n and m-n , it is evident that their different Aaaaaaaaaaaa~ Com binations taken n and n , are produced by the Alternations of the things composing the parts one amongst the other : And therefore the number of those = to the number of these = to the number of the Alternations of m things taken m and m , the Indices of whose occurrences are n and m-n =mx m-1 x n-2 x m-3 x &amp;c. / n x n-1 x &amp;c. x m-n x m-n-1 x &amp;c. continued to m places each Series continued to n and m-n places respectively ( by Lem .
4th ) i. e. because n+ m-n =m=mx m-1 x m-2 x m-3 &amp;c. / n x n-1 x n-2 x n-3 &amp;c. each Series continued to n places Q. E. D. But the number of the Alternations in every Combination is =nxn1xn2xn3 x , &amp;c. continued to n places , by Lem .
3d therefore .
Lemma 6th .
The number of the Alternations of m things abc d , &amp;c. different each from other , taken n and n , is =mx m-1 xm2xm3 x , &amp;c. continued to n places .
Q. E. D. Scholium .
Since in the things exposed the same things may occur more than once , and also n be less than m , the Indices of the occurrences which are in some of the Combinations of m things taken n and n , may differ from those which are in others ; but those Combinations , the Indices of whose occurrences are the same , are said to be in the same form : Therefore whereas n is equal to the sum of the Indices which are in each Combination taken n and n , if n be expressed by all the different Combinations of such Indices only ( being integer numbers ) whereof no one may exceed the highest Index of the things exposed , and being more than one in a Combination , are each of them , which are in the same Combination , comprehended in a distinct Index thereof ; these Expressions of n will necessarily be the several forms of the Combinations taken n and n , whereof m things are capable : Whence is derived a General Theorem for finding the Combinations and Alternations of m things taked n and n universally : i. e. Whether m consist of things all different or not , and whether n be equal to , or less than m. Theorem .
If n be expressed , according to all the different Forms of Combination which the things exposed are capable of , ~p = the highest Index ~~ = the number of ps ~In every ~q = the next highest ~~ = the number of ~qs form of and ~r = the next highest ~= the number of rs ~Com~s = the next highest ~= the number of ss ~nation .
&amp;c. ~A = the number of all Indices not less than p ~which are ~B = the number of all Indices not less than q ~in the ~C = the number of all Indices not less than r ~things ~D = the number of all Indices not less than s ~Expos 'd &amp;c. and b=~+ ~ , c=b+ ~ , d=c+ ~ , &amp;c. I say the number of the Combinations of m things taken n and n , in any one Form of Combination , shall be Ax A-1 xA 2/ ~ x~1x~2 &amp;c. x B-~ x B-~-1/ ~ x~1x &amp;c. x C-b x C-b-1/ ~ x~1 x &amp;c. x D-c x D-c-1/ ~ x~1 &amp;c. continued to so many Terms as there are different Indices in the form of Combination and each Term to ~ , ~ , ~ , ~ , &amp;c. places respectively , and this number multiplied into x n-1 x n-2 x n-3 x n-4 x n-4 x n-5 x n-6 &amp;c. continued to n places , / p x p-1+p-2 x &amp;c. ~xqx q-1 x &amp; ~ ~x~x r-1 x &amp;c. ~x &amp;c. each Series continued to p , q r~ &amp;c. places respectively , shall be the number of their Alternations .
But the sum of all the Combinations and Alternations which are in every Form of n , shall be the whole number of Combinations and Alternations of m things taken n and n. Demonstration .
First , Then it is evident , that those Combinations , which are in different forms , differ from each other .
Again , It is evident that the Combinations of m things , as ap bp cp dp eq fq gq hr ir , &amp;c. ( the Indices simply considered ) taken n and n , in a form wherein are ps qs and r s , shall be equal to the number of the Combinations of the ps , which are in the things exposed , taken ~ and ~ , multiplied into the number of the Combinations of the qs taken ~ and ~ multiplied into the number of the Combinations of the rs taken ~ and ~ .
But because p and all lesser Indices are comprehended in every Index which is greater than themselves ; therefore is A= to the number of ps which are in the things exposed , and for the same reason , would B= the number of the qs , and C the number of rs : But the number of the ps , which are in every form of Combination , is = ~ ; therefore it B~= to the number of qs ; also because the number of ps and qs together , which are in every form of Combination , whereisn there are qs , is =~+~= b ; therefore is Cb= to the number of rs , and so on , how many soever were the different Indices in any form of Combination .
But ( by Lem .
5th ) the number of the Combinations of the p s , which are in the things exposed , whose number is A , taken ~ and ~ , is =AxA1xA~ 2/ ~ x~1x~2 &amp;c. continued to ~ places , and the number of the Combinations of the qs , whose number is B~ ~ , taken ~ and ~ , is =B~xB~ 1/ ~ x~1 xB~ 2/ x~2 &amp;c. continued to ~ places , and the number of the Combinations of the r~ , whose number is C b , taken ~ and ~ , is =CbxCb 1/ ~ x~ -1 &amp;c. continued to ~ places Q. E. D. But But every Combination , in one and the same form , affords the same number of Alternations : Therefore the number of Alternations , in any one form , is so many times the number of Combinations , as is the number of Alternations in any one of these Combinations .
But ( by D em. 4th ) the number of Alternations in any of those Combinations shall be nx n-1 x n--2 x n--3 x a--4 4 a--5 x n--6 x &amp; c , continued to n places ~~ ~/ px p-1 x p-2 x &amp;c. ~~x~x q--2 x &amp;c. ~~xx r-1 x &amp;c. ~~x each Series continued to pq~ &amp;c. places respectively .
Q. E. D. Now to make an application of this general Rule to those particular cases which have already been considered by others , and which are contained in our 3d , 4th , 5th and 6th Lemma 's , and by us more generally demonstrated ; I say If n= m , there can be but one form of Combination , and but one Combination in that form ; and therefore the number of Alternations =mxm --1 x m--2 x m--3 x m--4 x &amp; c continued to m places / ~/ ~~ ~/ px p--1 x &amp;c. ~~xqx q--1 x &amp;c. ~ ~xrx &amp; c ~~ &amp;c. each Series to pq r , &amp;c. places respectively , i. e. ( if p= 1 ) =mxm1xm2xm3xm4x &amp;c. continued to m places , which are the cases of the 4th and 3d Lemma 's .
But if the things exposed are all different , and n be less than m , which is the case of the 5th and 6th Lemma 's , then also can there be but one form of Combination , and it will be A=m &amp; ~= n , and the whole number of Combinations =AxA1x A-2 x &amp;c. / ~ x~1x~~2x &amp;c. i. e. =mxm1xm2x &amp; c/ nxn1xn2x &amp; c each Series continued to n places , and therefore the number of Alternations =mxm1xm2x &amp;c. continued to n places .
But fully to Illustrate this Theorem , which , as delivered in general , may seem somewhat too Abstracted , to be commonly understood , I shall subjoyn one short Example .
Example .
Let the things exposed be aaabbbc c , or according to our way of notation a3 b3 c2 ; It is required to find the number of their Combinations and Alternations taken 4 and 4 .
Then ( because in the things exposed , there is no one thing occurs more than thrice , nor more than three things different from each other ) will all the forms of Combination , which the things exposed are capable of , be these , ~3 .
1~ viz. ~2 .
2 ~Then ~2 .
1 .
1~ In the 1st form will p= 3 , q= 1 , ~= 1 , ~= 1 , A= 2 , B=3 In the 2d form will p= 2 , ~ , ~= 2 , ~ , A= 3 , ~ In the 3d form will p= 2 , q= 1 , ~= 1 , ~= 2 , A= 3 , B=3 The number of Combinati= A/ ~ x B-~/ ~ = 2/ 1 x 2/ 1 =4 ons in the 1st form The number of Combinati= AxA 1/ ~x~1=3x 2/ 2 x1=3 ons in the second form The number of Combina= AxB~~x B--~ ~ 1/ ~~x~1=2x 1/ 2 x1=3 tions in the 3d form ~ And the whole number of Combinations = 10 Also the number of Alternations .
In the 1st form =4xnx n-1 x n--2 x n--3/ ~/ ~/ px p-1 x p-2 ~~x q~=4 / 4x3x2x 1/ ~/ ~/ 3x2x1~1x=4x4= 16 In the 2d form =3xnxn --1 x n--2 x n-3/ ~/ ~/ px p-1 ~~= 4x 4x3x2x 1/ ~/ ~/ 2x1~2=3x6= 18 In the 3d form =3xnxn --1 x n--a x n--3/ ~/ ~/ pxp -1 ~~xq~=3x4x3x2x 1/ ~/ ~/ 2x1~1x12 =3 x12 =36 ~ And the whole number of Alternations = 70 Many are the Properties of this Theorem , in common with others , as , To find the Unciae of a Multinomial raised to any integer power .
To raise an Infinite Series to an integer power , though of an interrupted Order , without introducing any thing immaterial , or which must afterwards be expunged ; and many others .
But then so many Terms of the Series must be taken in at first as shall serve to the purposes of the intended approximation , otherwise as often as it shall fall short of that , the Operation must be began de novo .
Many likewise are the Properties peculiar to this Theorem , and great Variety of Problems might be framed ; and I scruple not to say , many may occur in Practice , which are solvable by this , and no other Method whatever .
Hence may be found the number of Words whereof the 24 Letters are capable , from one Letter in each Word , to any number of Letters given .
Hence may be found the number of all Numbers , to any given number of Places , which may be produced from any number of Figures given .
Hence also the Compass of a Musical Instrument being given , the Time and number of the Bars , whereof each Tune shall consist , the number of Tunes may be found which that Instrument is capable of .
To give an instance of the prodigious variety that there is in Music , I have Calculated the number of Tunes in Common Time , consisting of eight Bars each , which may be played on an Instrument of one Note Compass only , and it is this , viz. 27584 .
270157 .
013570 .
368586 .
999728 .
299176 .
whereas the Changes on 24 Bells is but 620448 .
401733 .
239439 .
360000 , which is but 1/ 444588 .
604583 of the number of Tunes , and yet Dr Wallis in his Algebra demonstrates , could not be dispatched in 31557 .
600000 .
000000 years .
If then the Instrument were of as many Notes ~ as any Instrument now in use , how ~~ Bbbbbbbbbbb b number of Tunes be encereas 'd ; the Calculation of which ( tho much more intricate and operose ) would be equally attainable by our Theorem .

