Dripread - Book

Two of the pots, 13 and 19, were in their proper places. As every interchange may result in a pot being put in its place, it is clear that twenty-two interchanges will get them all in order. But this number of moves is not the fewest possible, the correct answer being seventeen. Exchange the following pairs: (3-1, 2-3), (15-4, 16-15), (17-7, 20-17), (24-10, 11-24, 12-11), (8-5, 6-8, 21-6, 23-21, 22-23, 14-22, 9-14, 18-9). When you have made the interchanges within any pair of brackets, all numbers within those brackets are in their places. There are five pairs of brackets, and 5 from 22 gives the number of changes required?17.

239.?A JUVENILE PUZZLE.? solution

As the conditions are generally understood, this puzzle is incapable of solution. This can be demonstrated quite easily. So we have to look for some catch or quibble in the statement of what we are asked to do. Now if you fold the paper and then push the point of your pencil down between the fold, you can with one stroke make the two lines CD and EF in our diagram. Then start at A, and describe the line ending at B. Finally put in the last line GH, and the thing is done strictly within the conditions, since folding the paper is not actually forbidden. Of course the lines are here left unjoined for the purpose of clearness.

In the rubbing out form of the puzzle, first rub out A to B with a single finger in one stroke. Then rub out the line GH with one finger. Finally, rub out the remaining two vertical lines with two fingers at once! That is the old trick.

240.?THE UNION JACK.? solution A

There are just sixteen points (all on the outside) where three roads may be said to join. These are called by mathematicians "odd nodes." There is a rule that tells us that in the case of a drawing like the present one, where there are sixteen odd nodes, it requires eight separate strokes or routes (that is, half as many as there are odd nodes) to complete it. As we have to produce as much as possible with only one of these eight strokes, it is clearly necessary to contrive that the seven strokes from odd node to odd node shall be as short as possible. Start at A and end at B, or go the reverse way.

241.?THE DISSECTED CIRCLE.? solution

It can be done in twelve continuous strokes, thus: Start at A in the illustration, and eight strokes, forming the star, will bring you back to A; then one stroke round the circle to B, one stroke to C, one round the circle to D, and one final stroke to E?twelve in all. Of course, in practice the second circular stroke will be over the first one; it is separated in the diagram, and the points of the star not joined to the circle, to make the solution clear to the eye.

Pg198

242.?THE TUBE INSPECTOR'S PUZZLE.? solution

The inspector need only travel nineteen miles if he starts at B and takes the following route: BADGDEFIF CBEHKLIHGJK. Thus the only portions of line travelled over twice are the two sections D to G and F to I. Of course, the route may be varied, but it cannot be shortened.

243.?VISITING THE TOWNS.? solution

Note that there are six towns, from which only two roads issue. Thus 1 must lie between 9 and 12 in the circular route. Mark these two roads as settled. Similarly mark 9, 5,14, and 4, 8, 14, and 10, 6,15, and 10, 2, 13, and 3, 7, 13. All these roads must be taken. Then you will find that he must go from 4 to 15, as 13 is closed, and that he is compelled to take 3, 11, 16, and also 16, 12. Thus, there is only one route, as follows: 1, 9, 5, 14, 8, 4, 15, 6, 10, 2, 13, 7, 3, 11, 16, 12, 1, or its reverse?reading the line the other way. Seven roads are not used.

244.?THE FIFTEEN TURNINGS.? solution

O O 0 1;5 Q-

O 7 Q O <p

O CD iO

3Q c b c b

$-e?o o d> ?0-au

o p~-&

O O Q"0 O

(HHM^i)2

o o cH>

&*o o o

isO

& d) 0 9 O O

?) O O O

Amusements in Mathematics (PDF)