Amusements in Mathematics by Henry Ernest Dudeney (best free ebook reader for pc .txt) ๐
11.--THE CYCLISTS' FEAST.
'Twas last Bank Holiday, so I've been told,Some cyclists rode abroad in glorious weather.Resting at noon within a tavern old,They all agreed to have a feast together."Put it all in one bill, mine host," they said,"For every man an equal share will pay."The bill was promptly on the table laid,And four pounds was the reckoning that day.But, sad to state, when they prepared to square,'Twas found that two had sneaked outside and fled.So, for two shillings more than his due shareEach honest man who had remained was bled.They settled later with those rogues, no doubt.
Read free book ยซAmusements in Mathematics by Henry Ernest Dudeney (best free ebook reader for pc .txt) ๐ยป - read online or download for free at americanlibrarybooks.com
- Author: Henry Ernest Dudeney
- Performer: 0486204731
Read book online ยซAmusements in Mathematics by Henry Ernest Dudeney (best free ebook reader for pc .txt) ๐ยป. Author - Henry Ernest Dudeney
65.โTHE RAILWAY STATION CLOCK.โsolution
The time must have been 437/11 min. past two o'clock.
66.โTHE VILLAGE SIMPLETON.โsolution
The day of the week on which the conversation took place was Sunday. For when the day after to-morrow (Tuesday) is "yesterday," "to-day" will be Wednesday; and when the day before yesterday (Friday) was "to-morrow," "to-day" was Thursday. There are two days between Thursday and Sunday, and between Sunday and Wednesday.
67.โAVERAGE SPEED.โsolution
The average speed is twelve miles an hour, not twelve and a half, as most people will hastily declare. Take any distance you like, say sixty miles. This would have taken six hours going and four hours returning. The double journey of 120 miles would thus take ten hours, and the average speed is clearly twelve miles an hour.
68.โTHE TWO TRAINS.โsolution
One train was running just twice as fast as the other.
69.โTHE THREE VILLAGES.โsolution
Calling the three villages by their initial letters, it is clear that the three roads form a triangle, A, B, C, with a perpendicular, measuring twelve miles, dropped from C to the base A, B. This divides our triangle into two right-angled triangles with a twelve-mile side in common. It is then found that the distance from A to C is 15 miles, from C to B 20 miles, and from A to B 25 (that is 9 and 16) miles. These figures are easily proved, for the square of 12 added to the square of 9 equals the square of 15, and the square of 12 added to the square of 16 equals the square of 20.
70.โDRAWING HER PENSION.โsolution
The distance must be 6ยพ miles.
71.โSIR EDWYN DE TUDOR.โsolution
The distance must have been sixty miles. If Sir Edwyn left at noon and rode 15 miles an hour, he would arrive at four o'clockโan hour too soon. If he rode 10 miles an hour, he would arrive at six o'clockโan hour too late. But if he went at 12 miles an hour, he would reach the castle of the wicked baron exactly at five o'clockโthe time appointed.
72.โTHE HYDROPLANE QUESTION.โsolution
The machine must have gone at the rate of seven-twenty-fourths of a mile per minute and the wind travelled five-twenty-fourths of a mile per minute. Thus, going, the wind would help, and the machine would do twelve-twenty-fourths, or half a mile a minute, and returning only two-twenty-fourths, or one-twelfth of a mile per minute, the wind being against it. The machine without any wind could therefore do the ten miles in thirty-four and two-sevenths minutes, since it could do seven miles in twenty-four minutes.
73.โDONKEY RIDING.โsolution
The complete mile was run in nine minutes. From the facts stated we cannot determine the time taken over the first and second quarter-miles separately, but together they, of course, took four and a half minutes. The last two quarters were run in two and a quarter minutes each.
74.โTHE BASKET OF POTATOES.โsolution
Multiply together the number of potatoes, the number less one, and twice the number less one, then divide by 3. Thus 50, 49, and 99 multiplied together make 242,550, which, divided by 3, gives us 80,850 yards as the correct answer. The boy would thus have to travel 45 miles and fifteen-sixteenthsโa nice little recreation after a day's work.
75.โTHE PASSENGER'S FARE.โsolution
Mr. Tompkins should have paid fifteen shillings as his correct share of the motor-car fare. He only shared half the distance travelled for ยฃ3, and therefore should pay half of thirty shillings, or fifteen shillings.
76.โTHE BARREL OF BEER.โsolution
Here the digital roots of the six numbers are 6, 4, 1, 2, 7, 9, which together sum to 29, whose digital root is 2. As the contents of the barrels sold must be a number divisible by 3, if one buyer purchased twice as much as the other, we must find a barrel with root 2, 5, or 8 to set on one side. There is only one barrel, that containing 20 gallons, that fulfils these conditions. So the man must have kept these 20 gallons of beer for his own use and sold one man 33 gallons (the 18-gallon and 15-gallon barrels) and sold the other man 66 gallons (the 16, 19, and 31 gallon barrels).
77.โDIGITS AND SQUARES.โsolution
The top row must be one of the four following numbers: 192, 219, 273, 327. The first was the example given.
78.โODD AND EVEN DIGITS.โsolution
As we have to exclude complex and improper fractions and recurring decimals, the simplest solution is this: 79 + 51/3 and 84 + 2/6, both equal 841/3. Without any use of fractions it is obviously impossible.
79.โTHE LOCKERS PUZZLE.โsolution
The smallest possible total is 356 = 107 + 249, and the largest sum possible is 981 = 235 + 746, or 657 + 324. The middle sum may be either 720 =134+586, or 702 = 134 + 568, or 407 = 138 + 269. The total in this case must be made up of three of the figures 0, 2, 4, 7, but no sum other than the three given can possibly be obtained. We have therefore no choice in the case of the first locker, an alternative in the case of the third, and any one of three arrangements in the case of the middle locker. Here is one solution:โ
Of course, in each case figures in the first two lines may be exchanged vertically without altering the total, and as a result there are just 3,072 different ways in which the figures might be actually placed on the locker doors. I must content myself with showing one little principle involved in this puzzle. The sum of the digits in the total is always governed by the digit omitted. 9/9 - 7/10 - 5/11 - 3/12 - 1/13 - 8/14 - 6/15 - 4/16 - 2/17 - 0/18. Whichever digit shown here in the upper line we omit, the sum of the digits in the total will be found beneath it. Thus in the case of locker A we omitted 8, and the figures in the total sum up to 14. If, therefore, we wanted to get 356, we may know at once to a certainty that it can only be obtained (if at all) by dropping the 8.
80.โTHE THREE GROUPS.โsolution
There are nine solutions to this puzzle, as follows, and no more:โ
The seventh answer is the one that is most likely to be overlooked by solvers of the puzzle.
81.โTHE NINE COUNTERS.โsolution
In this case a certain amount of mere "trial" is unavoidable. But there are two kinds of "trials"โthose that are purely haphazard, and those that are methodical. The true puzzle lover is never satisfied with mere haphazard trials. The reader will find that by just reversing the figures in 23 and 46 (making the multipliers 32 and 64) both products will be 5,056. This is an improvement, but it is not the correct answer. We can get as large a product as 5,568 if we multiply 174 by 32 and 96 by 58, but this solution is not to be found without the exercise of some judgment and patience.
82.โTHE TEN COUNTERS.โsolution
As I pointed out, it is quite easy so to arrange the counters that they shall form a pair of simple multiplication sums, each of which will give the same productโin fact, this can be done by anybody in five minutes with a little patience. But it is quite another matter to find that pair which gives the largest product and that which gives the smallest product.
Now, in order to get the smallest product, it is necessary to select as multipliers the two smallest possible numbers. If, therefore, we place 1 and 2 as multipliers, all we have to do is to arrange the remaining eight counters in such a way that they shall form two numbers, one of which is just double the other; and in doing this we must, of course, try to make the smaller number as low as possible. Of course the lowest number we could get would be 3,045; but this will not work, neither will 3,405, 3,450, etc., and it may be ascertained that 3,485 is the lowest possible. One of the required answers is 3,485 ร 2 = 6,970, and 6,970 ร 1 = 6,970.
The other part of the puzzle (finding the pair with the highest product) is, however, the real knotty point, for it is not at all easy to discover whether we should let the multiplier consist of one or of two figures, though it is clear that we must keep, so far as we can, the largest figures to the left in both multiplier and multiplicand. It will be seen that by the following arrangement so high a number as 58,560 may be obtained. Thus, 915 ร 64 = 58,560, and 732 ร 80 = 58,560.
83.โDIGITAL MULTIPLICATION.โsolution
The solution that gives the smallest possible sum of digits in the common product is 23 ร 174 = 58 ร 69 = 4,002, and the solution that gives the largest possible sum of digits, 9 ร 654 = 18 ร 327 = 5,886. In the first case the digits sum to 6 and in the second case to 27. There is no way of obtaining the solution but by actual trial.
84.โTHE PIERROT'S PUZZLE.โsolution
There are just six different solutions to this puzzle, as follows:โ
It will be seen that in every case the two multipliers contain exactly the same figures as the product.
85.โTHE CAB NUMBERS.โsolution
The highest product is, I think, obtained by multiplying 8,745,231 by 96โnamely, 839,542,176.
Dealing here with the problem generally, I have shown in the last puzzle that with three digits there are only two possible solutions, and with four digits only six different solutions.
These cases have all been given. With five digits there are just twenty-two solutions, as follows:โ
Now, if we took every possible combination and tested it by multiplication, we should need to make no fewer than 30,240 trials, or, if we at once rejected the number 1 as a multiplier, 28,560 trialsโa task that I think most people would be inclined to shirk. But let us consider whether there be no shorter way of getting at
Comments (0)