Page:Amusements in mathematics.djvu/259

tiply these four numbers together and add the product, 210, to each of the nine numbers. The result is the nine consecutive composite numbers, 212 to 220 inclusive, with which we can form the required square. Every number will necessarily be divisible by its difference from 210. It will be very obvious that by this method we may find as many consecutive composites as ever we please. Suppose, for example, we wish to form a magic square of sixteen such numbers; then the numbers 2 to 17 contain the factors 2, 3, 5, 7, 11, 13, and 17, which, multiplied together, make 5 105 10 to be added to produce the sixteen numbers 5 105 12 to 510527 inclusive, all of which are composite as before.

But, as I have said, these are not the answers in the smallest numbers: for if we add 523 to the numbers i to 16, we get sixteen consecutive composites; and if we add 1,327 to the numbers I to 25, wa get twenty-five consecutive composites, in each case the smallest numbers possible. Yet if we required to form a magic square of a hundred such numbers, we should find it a big task by means of tables, though by the process I have shown it is quite a simple matter. Even to find thirty-six such numbers you will search the tables up to 10,000 without success, and the difficulty increases in an accelerating ratio with each square of a larger order.

412.—THE MAGIC KNIGHT'S TOUR.

46	55	44	19	58	9	22	7
43	18	47	56	21	6	59	10
54	45	20	41	12	57	8	23
17	42	53	48	5	24	11	60
52	3	32	13	40	61	34	25
31	16	49	4	33	28	37	62
2	51	14	29	64	39	26	35
15	30	1	50	27	36	63	38

Here each successive number (in numerical order) is a knight's move from the preceding number, and as 64 is a knight's move from 1, the tour is "re-entrant." All the columns and rows add up 260. Unfortunately, it is not a perfect magic square, because the diagonals are incorrect, one adding up 264 and the other 256—requiring only the transfer of 4 from one diagonal to the other. I think this is the best result that has ever been obtained (either re-entrant or not), and nobody can yet say whether a perfect solution is possible or impossible.

413.—A CHESSBOARD FALLACY.

The explanation of this little fallacy is as follows. The error lies in assuming that the little triangular piece, marked C, is exactly the same height as one of the little squares of the board. As a matter of fact, its height (if we make the sixty-four squares each a square inch) will be 1/7 in. Consequently the rectangle is really 9/7 in. by 7 in., so that the area is sixty-four square inches in either case. Now, although the pieces do fit together exactly to form the perfect rectangle, yet the directions of the horizontal lines in the pieces will not coincide. The new diagram above will make everything quite clear to the reader.

414.—WHO WAS FIRST?

Biggs, who saw the smoke, would be first; Carpenter, who saw the bullet strike the water, would be second; and Anderson, who heard the report, would be last of all.

415.—A WONDERFUL VILLAGE.

When the sun is in the horizon of any place (whether in Japan or elsewhere), he is the length of half the earth's diameter more distant from that place than in his meridian at noon. As the earth's semi-diameter is nearly 4,000 miles, the sun must be considerably more than 3,000 miles nearer at noon than at his rising, there being no valley even the hundredth part of 1,000 miles deep.

416.— A CALENDAR PUZZLE.

The first day of a century can never fail on a Sunday; nor on a Wednesday or a Friday.

417.—THE TIRING-IRONS.

I will give my complete working of the solution, so that readers may see how easy it is when you know how to proceed. And first of all, as there is an even number of rings, I will say that they may all be taken off in one-third of $(2^{n+1}-2)moves;andsince<math>n$ in our case is 14, all the rings may be taken off in 10,922 moves. Then I say 10,922-9,999=923, and proceed to find the position when only 923 out of the 10,922 moves remain to be made. Here is the curious method of doing this. It is based on