by Dudeney, Henry Ernest, 1857-1930
Available in 215 free installments
Owner:
The number of men would be sixty-one times a square number; but when Harold himself joined in the fray they were then able to form one large square. What is the smallest possible number of men there could have been?
In order to make clear to the reader the simplicity of the question, I will give the lowest solutions in the case of 60 and 62, the numbers immediately preceding and following 61. They are 60 * 4 2 + 1 = 31 2 , and 62 x 8 2 + 1 = 63 2 . That is, 60 squares of 16 men each would be 960 men, and when Harold joined them they would be 961 in number, and so form a square with 31 men on every side. Similarly in the case of the figures I have given for 62. Now, find the lowest answer for 61.
130.?THE SCULPTOR'S PROBLEM.
An ancient sculptor was commissioned to supply two statues, each on a cubical pedestal. It is with these pedestals that we are concerned. They were of unequal sizes, as will be seen in the illustration, and when the time arrived for payment a dispute arose as to whether the agreement was based on lineal or cubical p 9 24 measurement. But as soon as they came to measure the two pedestals the matter was at once settled, because, curiously enough, the number of lineal feet was exactly the same as the number of cubical feet. The puzzle is to find the dimensions for two pedestals having this peculiarity, in the smallest possible figures. You see, if the two pedestals, for example, measure respectively 3 ft. and 1 ft. on every side, then the lineal measurement would be 4 ft. and the cubical contents 28 ft., which are not the same, so these measurements
will not do.
131.?THE SPANISH MISER.
There once lived in a small town in New Castile a noted miser named Don Manuel Rodriguez. His love of money was only equalled by a strong passion for arithmetical problems. These puzzles usually dealt in some way or other with his accumulated treasure, and were propounded by him solely in order that he might have the pleasure of solving them himself. Unfortunately very few of them have survived, and when travelling through Spain, collecting material for a proposed work on "The Spanish Onion as a Cause of National Decadence," I only discovered a very few. One of these concerns the three boxes that appear in the accompanying authentic portrait.
Each box contained a different number of golden doubloons. The difference between the number of doubloons in the upper box and the number in the middle box was the same as the difference between the number in the middle box and the number in the bottom box. And if the contents of any two of the boxes were united they would form a square number. What is the smallest number of doubloons that there could have been in anyone of the boxes?
132.?THE NINE TREASURE BOXES.
The following puzzle will illustrate the importance on occasions of being able to fix the minimum and maximum limits of a required number. This can very frequently be done. For example, it has not yet been ascertained in how many different ways the knight's tour can be performed on the chess board; but we know that it is fewer than the number of combinations of 168 things taken 63 at a time and is greater than 31,054,144?for the latter is the number of routes of a particular type. Or, to take a more familiar case, if you ask a man how many coins he has in his pocket, he may tell you that he has not the slightest idea. But on further questioning you will get out of him some such statement as the following: "Yes, I am positive that I have more than three coins, and equally certain that there are not so many as twenty-five." Now, the knowledge that a certain number lies between 2 and 12 in my puzzle will enable the solver to find the exact answer; without that information there would be an infinite number of answers, from which it would be impossible to select the correct one.