Kitabı oku: «The Canterbury Puzzles, and Other Curious Problems», sayfa 10
SOLUTIONS
THE CANTERBURY PUZZLES
1.—The Reve's Puzzle
The 8 cheeses can be removed in 33 moves, 10 cheeses in 49 moves, and 21 cheeses in 321 moves. I will give my general method of solution in the cases of 3, 4, and 5 stools.
Write out the following table to any required length:—
The first row contains the natural numbers. The second row is found by adding the natural numbers together from the beginning. The numbers in the third row are obtained by adding together the numbers in the second row from the beginning. The fourth row contains the successive powers of 2, less 1. The next series is found by doubling in turn each number of that series and adding the number that stands above the place where you write the result. The last row is obtained in the same way. This table will at once give solutions for any number of cheeses with three stools, for triangular numbers with four stools, and for pyramidal numbers with five stools. In these cases there is always only one method of solution—that is, of piling the cheeses.
In the case of three stools, the first and fourth rows tell us that 4 cheeses may be removed in 15 moves, 5 in 31, 7 in 127. The second and fifth rows show that, with four stools, 10 may be removed in 49, and 21 in 321 moves. Also, with five stools, we find from the third and sixth rows that 20 cheeses require 111 moves, and 35 cheeses 351 moves. But we also learn from the table the necessary method of piling. Thus, with four stools and 10 cheeses, the previous column shows that we must make piles of 6 and 3, which will take 17 and 7 moves respectively—that is, we first pile the six smallest cheeses in 17 moves on one stool; then we pile the next 3 cheeses on another stool in 7 moves; then remove the largest cheese in 1 move; then replace the 3 in 7 moves; and finally replace the 6 in 17: making in all the necessary 49 moves. Similarly we are told that with five stools 35 cheeses must form piles of 20, 10, and 4, which will respectively take 111, 49, and 15 moves.
If the number of cheeses in the case of four stools is not triangular, and in the case of five stools pyramidal, then there will be more than one way of making the piles, and subsidiary tables will be required. This is the case with the Reve's 8 cheeses. But I will leave the reader to work out for himself the extension of the problem.
2.—The Pardoner's Puzzle
The diagram on page 165 will show how the Pardoner started from the large black town and visited all the other towns once, and once only, in fifteen straight pilgrimages.
See No. 320, "The Rook's Tour," in A. in M.
3.—The Miller's Puzzle
The way to arrange the sacks of flour is as follows:—2, 78, 156, 39, 4. Here each pair when multiplied by its single neighbour makes the number in the middle, and only five of the sacks need be moved. There are just three other ways in which they might have been arranged (4, 39, 156, 78, 2; or 3, 58, 174, 29, 6; or 6, 29, 174, 58, 3), but they all require the moving of seven sacks.
4.—The Knight's Puzzle
The Knight declared that as many as 575 squares could be marked off on his shield, with a rose at every corner. How this result is achieved may be realized by reference to the accompanying diagram:—Join A, B, C, and D, and there are 66 squares of this size to be formed; the size A, E, F, G gives 48; A, H, I, J, 32; B, K, L, M, 19; B, N, O, P, 10; B, Q, R, S, 4; E, T, F, C, 57; I, U, V, P, 33; H, W, X, J, 15; K, Y, Z, M, 3; E, a, b, D, 82; H, d, M, D, 56; H, e, f, G, 42; K, g, f, C, 32; N, h, z, F, 24; K, h, m, b, 14; K, O, S, D, 16; K, n, p, G, 10; K, q, r, J, 6; Q, t, p, C, 4; Q, u, r, i, 2. The total number is thus 575. These groups have been treated as if each of them represented a different sized square. This is correct, with the one exception that the squares of the form B, N, O, P are exactly the same size as those of the form K, h, m, b.
5.—The Wife of Bath's Riddles
The good lady explained that a bung that is made fast in a barrel is like another bung that is falling out of a barrel because one of them is in secure and the other is also insecure. The little relationship poser is readily understood when we are told that the parental command came from the father (who was also in the room) and not from the mother.
6.—The Host's Puzzle
The puzzle propounded by the jovial host of the "Tabard" Inn of Southwark had proved more popular than any other of the whole collection. "I see, my merry masters," he cried, "that I have sorely twisted thy brains by my little piece of craft. Yet it is but a simple matter for me to put a true pint of fine old ale in each of these two measures, albeit one is of five pints and the other of three pints, without using any other measure whatever."
The host of the "Tabard" Inn thereupon proceeded to explain to the pilgrims how this apparently impossible task could be done. He first filled the 5-pint and 3-pint measures, and then, turning the tap, allowed the barrel to run to waste—a proceeding against which the company protested; but the wily man showed that he was aware that the cask did not contain much more than eight pints of ale. The contents, however, do not affect the solution of the puzzle. He then closed the tap and emptied the 3-pint into the barrel; filled the 3-pint from the 5-pint; emptied the 3-pint into the barrel; transferred the two pints from the 5-pint to the 3-pint; filled the 5-pint from the barrel, leaving one pint now in the barrel; filled 3-pint from 5-pint; allowed the company to drink the contents of the 3-pint; filled the 3-pint from the 5-pint, leaving one pint now in the 5-pint; drank the contents of the 3-pint; and finally drew off one pint from the barrel into the 3-pint. He had thus obtained the required one pint of ale in each measure, to the great astonishment of the admiring crowd of pilgrims.
7.—Clerk of Oxenford's Puzzle
The illustration shows how the square is to be cut into four pieces, and how these pieces are to be put together again to make a magic square. It will be found that the four columns, four rows, and two long diagonals now add up to 34 in every case.
8.—The Tapiser's Puzzle
The piece of tapestry had to be cut along the lines into three pieces so as to fit together and form a perfect square, with the pattern properly matched. It was also stipulated in effect that one of the three pieces must be as small as possible. The illustration shows how to make the cuts and how to put the pieces together, while one of the pieces contains only twelve of the little squares.
9.—The Carpenter's Puzzle
The carpenter said that he made a box whose internal dimensions were exactly the same as the original block of wood—that is, 3 feet by 1 foot by 1 foot. He then placed the carved pillar in this box and filled up all the vacant space with a fine, dry sand, which he carefully shook down until he could get no more into the box. Then he removed the pillar, taking great care not to lose any of the sand, which, on being shaken down alone in the box, filled a space equal to one cubic foot. This was, therefore, the quantity of wood that had been cut away.
10.—The Puzzle of the Squire's Yeoman
The illustration will show how three of the arrows were removed each to a neighbouring square on the signboard of the "Chequers" Inn, so that still no arrow was in line with another. The black dots indicate the squares on which the three arrows originally stood.
11.—The Nun's Puzzle
As there are eighteen cards bearing the letters "CANTERBURY PILGRIMS," write the numbers 1 to 18 in a circle, as shown in the diagram. Then write the first letter C against 1, and each successive letter against the second number that happens to be vacant. This has been done as far as the second R. If the reader completes the process by placing Y against 2, P against 6, I against 10, and so on, he will get the letters all placed in the following order:—CYASNPTREIRMBLUIRG, which is the required arrangement for the cards, C being at the top of the pack and G at the bottom.
12.—The Merchant's Puzzle
This puzzle amounts to finding the smallest possible number that has exactly sixty-four divisors, counting 1 and the number itself as divisors. The least number is 7,560. The pilgrims might, therefore, have ridden in single file, two and two, three and three, four and four, and so on, in exactly sixty-four different ways, the last manner being in a single row of 7,560.
The Merchant was careful to say that they were going over a common, and not to mention its size, for it certainly would not be possible along an ordinary road!
To find how many different numbers will divide a given number, N, let N = ap bq cr …, where a, b, c … are prime numbers. Then the number of divisors will be (p + 1) (q + 1) (r + 1) …, which includes as divisors 1 and N itself. Thus in the case of my puzzle—
To find the smallest number that has a given number of divisors we must proceed by trial. But it is important sometimes to note whether or not the condition is that there shall be a given number of divisors and no more. For example, the smallest number that has seven divisors and no more is 64, while 24 has eight divisors, and might equally fulfil the conditions. The stipulation as to "no more" was not necessary in the case of my puzzle, for no smaller number has more than sixty-four divisors.
13.—The Man of Law's Puzzle
The fewest possible moves for getting the prisoners into their dungeons in the required numerical order are twenty-six. The men move in the following order:—1, 2, 3, 1, 2, 6, 5, 3, 1, 2, 6, 5, 3, 1, 2, 4, 8, 7, 1, 2, 4, 8, 7, 4, 5, 6. As there are never more than one vacant dungeon to be moved into, there can be no ambiguity in the notation.
The diagram may be simplified by my "buttons and string" method, fully explained in A. in M., p. 230. It then takes one of the simple forms of A or B, and the solution is much easier. In A we use counters; in B we can employ rooks on a corner of a chessboard. In both cases we have to get the order
in the fewest possible moves.
See also solution to No. 94.
14.—The Weaver's Puzzle
The illustration shows clearly how the Weaver cut his square of beautiful cloth into four pieces of exactly the same size and shape, so that each piece contained an embroidered lion and castle unmutilated in any way.
15.—The Cook's Puzzle
There were four portions of warden pie and four portions of venison pasty to be distributed among eight out of eleven guests. But five out of the eleven will only eat the pie, four will only eat the pasty, and two are willing to eat of either. Any possible combination must fall into one of the following groups. (i.) Where the warden pie is distributed entirely among the five first mentioned; (ii.) where only one of the accommodating pair is given pie; (iii.) where the other of the pair is given pie; (iv.) where both of the pair are given pie. The numbers of combinations are: (i.) = 75, (ii.) = 50, (iii.) = 10, (iv.) = 10—making in all 145 ways of selecting the eight participants. A great many people will give the answer as 185, by overlooking the fact that in forty cases in class (iii.) precisely the same eight guests would be sharing the meal as in class (ii.), though the accommodating pair would be eating differently of the two dishes. This is the point that upset the calculations of the company.
16.—The Sompnour's Puzzle
The number that the Sompnour confided to the Wife of Bath was twenty-nine, and she was told to begin her count at the Doctor of Physic, who will be seen in the illustration standing the second on her right. The first count of twenty-nine falls on the Shipman, who steps out of the ring. The second count falls on the Doctor, who next steps out. The remaining three counts fall respectively on the Cook, the Sompnour, and the Miller. The ladies would, therefore, have been left in possession had it not been for the unfortunate error of the good Wife. Any multiple of 2,520 added to 29 would also have served the same purpose, beginning the count at the Doctor.
17.—The Monk's Puzzle
The Monk might have placed dogs in the kennels in two thousand nine hundred and twenty-six different ways, so that there should be ten dogs on every side. The number of dogs might vary from twenty to forty, and as long as the Monk kept his animals within these limits the thing was always possible.
The general solution to this puzzle is difficult. I find that for n dogs on every side of the square, the number of different ways is (n4 + 10n3 + 38n2 + 62n + 33) / 48, where n is odd, and ((n4 + 10n3 + 38n2 + 68n) / 48) + 1, where n is even, if we count only those arrangements that are fundamentally different. But if we count all reversals and reflections as different, as the Monk himself did, then n dogs (odd or even) may be placed in ((n4 + 6n3 + 14n2 + 15n) / 6) + 1 ways. In order that there may be n dogs on every side, the number must not be less than 2n nor greater than 4n, but it may be any number within these limits.
An extension of the principle involved in this puzzle is given in No. 42, "The Riddle of the Pilgrims." See also "The Eight Villas" and "A Dormitory Puzzle" in A. in M.
18.—The Shipman's Puzzle
There are just two hundred and sixty-four different ways in which the ship Magdalen might have made her ten annual voyages without ever going over the same course twice in a year. Every year she must necessarily end her tenth voyage at the island from which she first set out.
19.—The Puzzle of the Prioress
The Abbot of Chertsey was quite correct. The curiously-shaped cross may be cut into four pieces that will fit together and form a perfect square. How this is done is shown in the illustration.
See also p. 31 in A. in M.
20.—The Puzzle of the Doctor of Physic
Here we have indeed a knotty problem. Our text-books tell us that all spheres are similar, and that similar solids are as the cubes of corresponding lengths. Therefore, as the circumferences of the two phials were one foot and two feet respectively and the cubes of one and two added together make nine, what we have to find is two other numbers whose cubes added together make nine. These numbers clearly must be fractional. Now, this little question has really engaged the attention of learned men for two hundred and fifty years; but although Peter de Fermat showed in the seventeenth century how an answer may be found in two fractions with a denominator of no fewer than twenty-one figures, not only are all the published answers, by his method, that I have seen inaccurate, but nobody has ever published the much smaller result that I now print. The cubes of (415280564497 / 348671682660) and (676702467503 / 348671682660) added together make exactly nine, and therefore these fractions of a foot are the measurements of the circumferences of the two phials that the Doctor required to contain the same quantity of liquid as those produced. An eminent actuary and another correspondent have taken the trouble to cube out these numbers, and they both find my result quite correct.
If the phials were one foot and three feet in circumference respectively, then an answer would be that the cubes of (63284705 / 21446828) and (28340511 / 21446828) added together make exactly 28. See also No. 61, "The Silver Cubes."
Given a known case for the expression of a number as the sum or difference of two cubes, we can, by formula, derive from it an infinite number of other cases alternately positive and negative. Thus Fermat, starting from the known case 13 + 23 = 9 (which we will call a fundamental case), first obtained a negative solution in bigger figures, and from this his positive solution in bigger figures still. But there is an infinite number of fundamentals, and I found by trial a negative fundamental solution in smaller figures than his derived negative solution, from which I obtained the result shown above. That is the simple explanation.
We can say of any number up to 100 whether it is possible or not to express it as the sum of two cubes, except 66. Students should read the Introduction to Lucas's Théorie des Nombres, p. xxx.
Some years ago I published a solution for the case of
of which Legendre gave at some length a "proof" of impossibility; but I have since found that Lucas anticipated me in a communication to Sylvester.
21.—The Ploughman's Puzzle
The illustration shows how the sixteen trees might have been planted so as to form as many as fifteen straight rows with four trees in every row. This is in excess of what was for a long time believed to be the maximum number of rows possible; and though with our present knowledge I cannot rigorously demonstrate that fifteen rows cannot be beaten, I have a strong "pious opinion" that it is the highest number of rows obtainable.
22.—The Franklin's Puzzle
The answer to this puzzle is shown in the illustration, where the numbers on the sixteen bottles all add up to 30 in the ten straight directions. The trick consists in the fact that, although the six bottles (3, 5, 6, 9, 10, and 15) in which the flowers have been placed are not removed, yet the sixteen need not occupy exactly the same position on the table as before. The square is, in fact, formed one step further to the left.
23.—The Squire's Puzzle
The portrait may be drawn in a single line because it contains only two points at which an odd number of lines meet, but it is absolutely necessary to begin at one of these points and end at the other. One point is near the outer extremity of the King's left eye; the other is below it on the left cheek.
24.—The Friar's Puzzle
The five hundred silver pennies might have been placed in the four bags, in accordance with the stated conditions, in exactly 894,348 different ways. If there had been a thousand coins there would be 7,049,112 ways. It is a difficult problem in the partition of numbers. I have a single formula for the solution of any number of coins in the case of four bags, but it was extremely hard to construct, and the best method is to find the twelve separate formulas for the different congruences to the modulus 12.
25.—The Parson's Puzzle
A very little examination of the original drawing will have shown the reader that, as he will have at first read the conditions, the puzzle is quite impossible of solution. We have therefore to look for some loophole in the actual conditions as they were worded. If the Parson could get round the source of the river, he could then cross every bridge once and once only on his way to church, as shown in the annexed illustration. That this was not prohibited we shall soon find. Though the plan showed all the bridges in his parish, it only showed "part of" the parish itself. It is not stated that the river did not take its rise in the parish, and since it leads to the only possible solution, we must assume that it did. The answer would be, therefore, as shown. It should be noted that we are clearly prevented from considering the possibility of getting round the mouth of the river, because we are told it "joined the sea some hundred miles to the south," while no parish ever extended a hundred miles!
26.—The Haberdasher's Puzzle
The illustration will show how the triangular piece of cloth may be cut into four pieces that will fit together and form a perfect square. Bisect AB in D and BC in E; produce the line AE to F making EF equal to EB; bisect AF in G and describe the arc AHF; produce EB to H, and EH is the length of the side of the required square; from E with distance EH, describe the arc HJ, and make JK equal to BE; now, from the points D and K drop perpendiculars on EJ at L and M. If you have done this accurately, you will now have the required directions for the cuts.
I exhibited this problem before the Royal Society, at Burlington House, on 17th May 1905, and also at the Royal Institution in the following month, in the more general form:—"A New Problem on Superposition: a demonstration that an equilateral triangle can be cut into four pieces that may be reassembled to form a square, with some examples of a general method for transforming all rectilinear triangles into squares by dissection." It was also issued as a challenge to the readers of the Daily Mail (see issues of 1st and 8th February 1905), but though many hundreds of attempts were sent in there was not a single solver. Credit, however, is due to Mr. C. W. M'Elroy, who alone sent me the correct solution when I first published the problem in the Weekly Dispatch in 1902.
I add an illustration showing the puzzle in a rather curious practical form, as it was made in polished mahogany with brass hinges for use by certain audiences. It will be seen that the four pieces form a sort of chain, and that when they are closed up in one direction they form the triangle, and when closed in the other direction they form the square.
