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.

1234576 1627534 1352674 1574362

In this case the 1 is a repeater, and there are two separate cycles, 2, 3, 4, 2, and 5, 6, 7, 5. We thus get five groups of three lines each, for a fourth line in any group will merely repeat the first line.

A solution for 8 persons on 21 occasions is as follows:?

1 8634527 1 8457236 1 8273645

The 1 is here a repeater, and the cycle 2, 3,4, 5, 6, 7, 8. Everyone of the 3 groups will give 7 lines. Here is my solution for 9 persons on 28 occasions:?

219745638 295168347 2931 84756 291564783

There are here two repeaters, 1 and 2, and the cycle is 3, 4, 5, 6, 7, 8, 9. We thus get 4 groups of 7 lines each.

The case of 10 persons on 36 occasions is solved as follows:?

1 1083654729 1 1065297438 1 1029386574 1 1074832956

The repeater is 1, and the cycle, 2, 3, 4, 5, 6, 7, 8, 9,10. We here have 4 groups of 9 lines each. My solution for 11 persons on 45 occasions is as follows:?

2 11 9 476 5183 10

2 111 763 10 854 9

2 11 10 394 8517 6

2 11 5 813 10 679 4

2 11 110 34 9675 8

There are two repeaters, 1 and 2, and the cycle is, 3,4, 5,... 11. We thus get 5 groups of 9 lines each. The case of 12 persons on 55 occasions is solved thus:?

1 2 3 12 4 11 5 10 6 9 7 8

1 2 4 11 6 9 8 7 10 5 12 3

1 2 5 10 8 7 11 4 3 12 6 9

1 2 6 9 10 5 3 12 7 8 11 4

1 2 7 8 12 3 6 9 11 4 5 10

Here 1 is a repeater, and the cycle is 2, 3,4, 5,... 12. We thus get 5 groups of 11 lines each.

274.?THE MOUSE-TRAP PUZZLE.? solution

If we interchange cards 6 and 13 and begin our count at 14, we may take up all the twenty-one cards?that is, make twenty-one "catches"?in the following order: 6, 8, 13,2, 10, 1, 11,4, 14,3,5,7,21, 12, 15,20,9, 16, 18,17,19. We may also exchange 10 and 14 and start at 16, or exchange 6 and 8 and start at 19.

275.?THE SIXTEEN SHEEP? solution

The six diagrams on next page show solutions for the cases where we replace 2, 3, 4, 5, 6, and 7 hurdles. The dark lines indicate the hurdles that have been replaced. There are, of course, other ways of making the removals.

o o o|o

oofoo

ojo o[o oooo

o|o o o o o

_ o o|o o

o o o o oo

picture357

o o _c 10 oooo

oooo o o|oo .oojoo |o ojo o

276.?THE EIGHT VILLAS.? solution

There are several ways of solving the puzzle, but there is very little difference between them. The solver should, however, first of all bear in mind that in making his calculations he need only consider the four villas that stand at the corners, because the intermediate villas can never vary when the corners are known. One way is to place the numbers nought to 9 one at a time in the top left-hand corner, and then consider each case in turn.

A

B

D