3. When the same event may be repeated in a per-mutation, the number of permutations is the product of as many numbers, all equal to the whole number of possible events, as there are of events in each permutation. Thus, of four events, A, B, C, D, the number of per-mutations of two, with repetition, is 4 x 4 or 16 ; with-cut repetition 4 x 3 or 12. The additional 4 in the first case, are A A, B B, C C, and D D. The number of permutations of three, with repetition, is 4 x 4 x 4, or 64; without repetition, 4 x 3 x 2 or 24. Of the addi40, 10 are where A only is repeated; namely, A A B, AAC,AAD, ABA, ACA, ADA, BA A, CA A,
4. The number of combinations in which there are repetitions must be determined without rule, in every particular case. Suppose I wish to know how many comincluding repetitions, can be made of four out of seven. Let the seven be A, B, C, D, E, F, G.
- I.
The number, without repetition, is 35.
- II.
Those in which A is repeated twice, and no other, are evidently as many as the number of pairs in B, C, D, E, F, and G, that is, 15. Thus we have A A B C, A A C D, &c. There are as many in which B is retwice, &c., so that 7 x 15 or 105, is the numin which one only is repeated twice.
- III.The number in which A is repeated three times is evidently 6, and the number in which one or other is repeated three times only, is 6 X 7 or 42.
- IV.The number in which one is repeated four times, is 7.
- V.The number in which two are repeated twice, is as many as the number of pairs in 7, or 21.
Consequently, the whole number is made up of 35 105, 42, 7, and 21, or it is 210.
We have not so much to do with combinations allowrepetition, as with permutations of the same kind.To avoid the perpetual occurrence of long phrases for simple ideas, I shall use the following abbrevia: By P 4,20 1 is meant the number of per-mutations of 4 out of 20, without repetition : by P P 4,201 the same with repetition. By C 4,20 1 is meant the number of combinations of 4 out of 20, without repetition : by C C 4,201 the same with repetition. Again, by [4,20], as in page 15., is meant the product of all numbers from 4 to 20, both inclu; and, by 710, as in algebra, is meant ten sevens multiplied together. Thus, a reference to the preceding rules will show the following :
ON DIRECT PROBABILITIES.37
P {5,121 is [12, 8],PP-(5,12} is 125 C(4,25} is [25, 22] divided by [I, 4]
5. If there be an event composed of several others in succession, of which the first may happen in, say 10 different ways, the second in 14, and the third (let there be but three) in 6, then the compound event must be one out of 10 x 14 x 6, which is the number of difways in which it may happen. When all the component events may happen in the same number of ways, this reduces itself, both in principle and rule, to the case of permutation with repetition.
I now proceed to some problems requiring nothing but a knowledge of the measure of probability and the preceding rules. Any event of known circumstances may be familiarly represented by a lottery of balls of different colours. Thus, suppose ten Russian ships, twelve French, and fourteen English, are expected in port, or may have arrived. Let one .be as likely to aras another, and suppose it known that two have arrived, but not of which nation they are. Let a ceradvantage accrue to A, if they should happen to be Russian and French, of which he is desirous of selling his chance immediately. The question is precisely the following : Let there be a lottery of green, white, and red balls, 10, 12, and 14 in number. Let two have been drawn, and suppose a certain advantage to arise to A, if they be green and white. What should be given to A, certain, in consideration of his chance ?
Here we must first consider the number of ways in which two can be drawn. All the balls are 36 in numand the whole number of pairs is 36 x 35 - 2 or 630. Of these a green ball (1 out of 10) may be paired with a white ball (1 out of 12) in 120 different ways. Consequently, the probability of his gaining the advantage is or A. The probability against it is therefore ',?- : or out of every 21 possible events, 4 are in favour of, and 17 against, the advantage. It is there
D 3
38 ESSAY ON PROBABILITIES.
17 to 4, or 41 to 1, against the advantage. If the congain were 211. the value of the chance would be 41., as will hereafter be more fully shown.
Of all the pairs which can be drawn, there are
10 x 12 =120 green and white. l0 x 9=2=45 both green.
12 x 14= 16S white and red. 12 x 11=2=66 both white.
14 x 10=140 red and green. 14 x 13=2=91 both red.
The sum of these is 630, as it should be. The reader should explain to himself the reason of the difference of process. The least probable case is both green, the most probable white and red. Nothing is more common than the idea that the event most likely to happen, which is compounded of two or more events, is a repetition of the event which is individually the most probable. This is true of repetitions : red being most probable, it is more probable that red should be repeatthan that white should be repeated, or that green should be repeated ; but that two white ones should be drawn is not so probable as that a white and red should be drawn. The drawing, whatever it may be, is conindependently of succession and this makes an important difference. If the balls were drawn succesboth red is more probable than white followed by red, or than red followed by white, but not more probable than the chance of one or other, which is the preceding case.
I here also take occasion to notice the common error, that because an event is more probable than any other, it is the one to be looked for. The question ought to be, Is that event more probable than some one or other out of all the other events which may happen ? If ten persons engage in a competition, with an equal chance of success, and if two of them, A and B, enter into partnership, it is now more probable that the firm of A and B will win than that C will win, or that D will win, &c. But the chances against the firm are still 8 to 2 or 4 to 1. If a hundred halfpence be tossed up into the air, the result which is more probable than any other, is 50 heads and 50 tails. But comsense will tell us that the chances of this result are
ON DIRECT PROBABILITIES. 39
very small, out of the whole, and calculation would con-firm it.
Before laying down any more specific rules, I shall take an instance of a somewhat complicated deduction, in order to show that we do not really require any other principle than is contained in the measure of probability. Suppose A and B to play at whist against
C and D. A begins, holding ace, king, and queen of trumps, and these trumps only : what right has he to exthat, by playing them out in succession, he will force all the trumps of the other party ? That is to say, ten trumps being distributed among B, C, and D, and any single card having the same chance of belonging to either of the three, what is the probability ,that neither C nor
D holds more than three trumps ?
Firstly, as to the number of tenures, which are perdistinct. To find the number of ways in which any number of distinct objects can be divided among any number of persons, use the following RULE :
Multiply together numbers equal to the number of persons as often as there are things to be divided among them. Thus, to find in how many different ways ten distinct cards can be divided among three persons, find
3 x 3 x 3, &c. (ten threes) or 3i0 which is 59049.
The question now is, how many of these 59049 ways favour the supposition that neither C nor D holds more than three out of ten. Both together they cannot hold more than six : if, then, we pick out any given six of the ten trumps, that set may be divided among C and D in 26 or 64 ways. But of these, there are two ways in which 0 and 6 may be held, twelve ways for 1 and 5, and thirty ways for 2 and 4, none of which must be included. It must be observed, that in the last sentence, the six distinct ways into which 6 may be divided into parcels of 1 and 5 must be doubled, because * each gives two of our cases, ac
* It is important to observe that no duplication must take place on this account, if the two numbers be the same; for instance, in dividing 6 into parcels old.
D 4
40 ESSAY ON PROBABILITIES.
cording as C holds 1 and D holds 5, or C holds 5 and D holds 1 : and so of the other cases. Consequently, out of a given set of six, there are 64 all but 44, that is, 20 ways, in which, when they happen, A could force all the adversary's trumps. But every set of six yields 20 such cases : hence the ways in which C and D can
together hold six trumps, are 20 times C 6,101 or 20 x 210, or 4200. Similarly, a given set of 5 trumps may be held by C and D in 23 or 32 ways, of which 2 and 10 must be excluded. Hence 20 x C t 5,10 1 or 20 x 252, or 5040 sets are the number favourable to the event in this case. Four trumps can be held in 24 or 16 ways, of which 2 must be excluded, or 14 x C 4,10 } that is, 2940, is the number of favour-able cases. On the supposition that C and D together hold only 3, or 2, or 1 trump, no exclusions are necesand the number of cases are 23 x C i 3,10 1 or 960, and 2= x C 2,10 1 or 180, and 2 x C 1 1,101 or 20 ; and there is one case in which C and D hold no trumps. All the favourable cases are, therefore, in number
4200 + 5040 + 2940 + 960 + 180 + 20 + 1 or 13341.
The chance of A being able to force all the adversary's trumps is Si;?Jg, or nearly 3i to 1 against it.
Given a fraction less than unity, and which has high numbers in its terms, required a set of fractions which shall be very nearly equal to it, and each of which shall be nearer than any other fraction of the same order of simplicity. Required, also, a near estimate of the error committed in each case.
RULE. First perform the process for finding the greatest common measure of the numerator and deno
ON DIRECT PROBABILITIES. 41
13341),59049(4=4
53364
5685)13341(2 X 4+1=9 11370
2 x2+1=5 1971)5685(4 x 9+4=22 3942
5x1+2=7 1743)1971(1x22+9=31 1743
7x7+5=54 228)- 1743(7x31+22=239 1596
54x1+7=61 147- )228(1x239+31=270 147
81)147(1 81
66 &c.
Opposite to the first quotient write 1, and proceed to form columns out of the several quotients, in the folmanner :
1 =1st Numerator. 1st Quotient = 1st Denomina
2nd Qu.=2d Num. 2d Qu. x 1st Qu. + 1 = 2d Den.
2d Num. x 3d Qu. + 1st Num. 3d Qu. x 2d Den. + 1st Den. =3d Num. =3d Den.
3d Num. x 4th Qu. + 2d Num. 4th Qu. x 3d Den. + 2d Den. =4th Num. =4th Den.
4th Num. x 5thQu. + 3d Num. 5th Qu. x 4th Den. + 3d Den. =5th Num. =5th Den.
Any numerator multiplied by Any denominator multiplied
the next quotient, and pro- by the next quotient, and
duct increased by preceding product increased by pre
numerator, gives succeeding ceding denominator, gives
numerator. succeeding denominator.
Thus, 'n, -, h, 3 1, 154g, s i o, &c. &c., is a set of fractions which approach nearer and nearer to ally. The first is always too great, the second too small, the third too great, the fourth too small : every odd one too great, every even one too small.
Test of correctness. Take any two successive numerand denominators, multiplied crosswise ; they give products which differ by unity.
42 ESSAY ON PROBABILITIES:
54 61 54 x 270=14580
239 270 239 x 61 =14579
1
Estimation of the error. The error of a is less than 316- (4 x 9 = 36) ; that of is less than --- (9 X 22 = 198) ; that of _sz is less than 61-T_7. (22 x 31 = 682), &c.
The error of any Numerator is less than 1
its Denominator That Den. x the next.
I now take the following problem : A die is thrown time after time ; in how many times have we an even chance of throwing an ace. The common error attached to this problem is, that since there are six faces, it is most likely all will have come up in six throws.
In the first throw there are six events, five of which are unfavourable. In the first two throws, considered as giving one event, there are 6 x 6 or 36 possible cases, for every possible case of the first throw may comwith any case of the second. But of these 36 throws, any one of the five unfavourables of the first throw may combine with any one of the second throw, and there are therefore 5 x 5, or 25 unfavourable comevents. Hence the following table : -
One throw gives 6 cases ; 5 unfavourable
Two throws give 36 cases ; 25 unfavourable
Three 216 ; 125 (odds still
against.)
Four 1296 ; 625 (odds
turned in favour.)
Five 7776 ; 3125 &c.
Answer : There is not quite an even chance of doing it in three throws, but more than an even chance of doing it in four.
RULE. When the odds against success in one trial are n to 1, then o of n. (or the nearest whole numto it) is about the number of trials in which there is an even chance of one success: more correctly ioo of n. Thus, if it be 144 to 1 against a single attempt,
ON DIRECT PROBABILITIES. 43
there is about an even chance of one success in 100 throws.
A table of the number of trials (odds being n. to 1) in which there are various odds of succeeding once :