Amusements in Mathematics (PDF)

by Dudeney, Henry Ernest, 1857-1930

Available in 215 free installments

Owner:

View book

Email address:

Enter your email address above to start receiving your free daily installments.

Dripread will never disclose your email address to third parties.

Now, if we place 9 in the corner as shown in the Diagram A, two of the corners cannot be occupied, while the corner that is diagonally opposite may be filled by 0,1, 2, 3, 4, 5, 6, 7, 8, or 9 persons. We thus see that there are 10 solutions with a 9 in the corner. If, however, we substitute 8, the two corners in the same row and column may contain 0, 0, or 1,1, or 0,1, or 1, 0. In the case of B, ten different selections maybe made for the fourth corner; but in each of the cases C, D, and E, only nine selections are possible, because we cannot use the 9. Therefore with 8 in the top left-hand corner there are 10 + (3 * 9) = 37 different solutions. If we then try 7 in the corner, the result will be 10 + 27 + 40, or 77 solutions. With 6 we get 10 + 27 + 40 + 49 = 126; with 5, 10 + 27 + 40 + 49 + 54 = 180; with 4, the same as with 5, + 55 = 235 ; with 3, the same as with 4, + 52 = 287; with 2, the same as with 3, + 45 = 332; with 1, the same as with 2, + 34 = 366, and with nought in the top left-hand corner the number of solutions will be found to be 10 + 27 + 40 + 49 + 54 + 55 + 52 + 45 + 34 + 19 = 385. As there is no other number to be placed in the top left-hand corner, we have now only to add these totals together thus, 10 + 37 + 77 + 126 + 180 + 235 + 287 + 332 + 366 + 385 = 2,035. We therefore find that the total number of ways in which tenants may occupy some or all of the eight villas so that there shall be always nine persons living along each side of the square is 2,035. Of course, this method must obviously cover all the reversals and reflections, since each corner in turn is occupied by every number in all possible combinations with the other two corners that are in line with it.

Here is a general formula for solving the puzzle: ( rjZ + ^ n + 2 W + 3n + 3 )/ 6 . Whatever may be the stipulated

number of residents along each of the sides (which number is represented by n), the total number of different arrangements may be thus ascertained. In our particular case the number of residents was nine. Therefore

Pg207

(81 + 27 + 2) x (81 +27 + 3) and the product, divided by 6, gives 2,035. If the number of residents had been 0, 1, 2, 3, 4, 5, 6, 7, or 8, the total arrangements would be 1, 7, 26, 70, 155, 301, 532, 876, or 1,365 respectively.

277.?COUNTER CROSSES.? solution

Let us first deal with the Greek Cross. There are just eighteen forms in which the numbers may be paired for the two arms. Here they are:?

12978 13968 14958 34956 24957 23967 23958 13769 14759 14967 24758 23768 12589 23759 13579 34567 14768 24568 14569 23569 14379 23578 14578 25368 15369 24369 23189 24378 15378 45167 24179 25169 34169 35168 34178 25178

Of course, the number in the middle is common to both arms. The first pair is the one I gave as an example. I will suppose that we have written out all these crosses, always placing the first row of a pair in the upright and the second row in the horizontal arm. Now, if we leave the central figure fixed, there are 24 ways in which the numbers in the upright may be varied, for the four counters may be changed in 1 x2x3*4 = 24 ways. And as the four in the horizontal may also be changed in 24 ways for every arrangement on the other arm, we find that there are 24 * 24 = 576 variations for every form; therefore, as there are 18 forms, we get 18 x 576 = 10,368 ways. But this will include half the four reversals and half the four reflections that we barred, so we must divide this by 4 to obtain the correct answer to the Greek Cross, which is thus 2,592 different ways. The division is by 4 and not by 8, because we provided against half the reversals and reflections by always reserving one number for the upright and the other for the horizontal.

In the case of the Latin Cross, it is obvious that we have to deal with the same 18 forms of pairing. The total number of different ways in this case is the full number, 18 x 576. Owing to the fact that the upper and lower arms are unequal in length, permutations will repeat by reflection, but not by reversal, for we cannot reverse. Therefore this fact only entails division by 2. But in every pair we may exchange the figures in the upright with those in the horizontal (which we could not do in the case of the Greek Cross, as the arms are there all alike); consequently we must multiply by 2. This multiplication by 2 and division by 2 cancel one another. Hence 10,368 is here the correct answer.

Pg208

278.?A DORMITORY PUZZLE.? solution

7VION.

TH4iftS.

TVtr:^

weir*

SAT.

Arrange the nuns from day to day as shown in the six diagrams. The smallest possible number of nuns would be thirty-two, and the arrangements on the last three days admit of variation.