Science
Read books online » Science » Amusements in Mathematics by Henry Ernest Dudeney (e books for reading txt) 📖

Book online «Amusements in Mathematics by Henry Ernest Dudeney (e books for reading txt) 📖». Author Henry Ernest Dudeney



1 ... 21 22 23 24 25 26 27 28 29 ... 87
Go to page:
and especially to pay a visit to a very old friend living at the town marked Z. What he proposed was this: that he would start from his home, enter every town once and only once, and finish his journey at Z. As he made up his mind to perform this grand tour by rail only, he found it rather a puzzle to work out his route, but he at length succeeded in doing so. How did he manage it? Do not forget that every town has to be visited once, and not more than once.

251.—WATER, GAS, AND ELECTRICITY.

There are some half-dozen puzzles, as old as the hills, that are perpetually cropping up, and there is hardly a month in the year that does not bring inquiries as to their solution. Occasionally one of these, that one had thought was an extinct volcano, bursts into eruption in a surprising manner. I have received an extraordinary number of letters respecting the ancient puzzle that I have called "Water, Gas, and Electricity." It is much older than electric lighting, or even gas, but the new dress brings it up to date. The puzzle is to lay on water, gas, and electricity, from W, G, and E, to each of the three houses, A, B, and C, without any pipe crossing another. Take your pencil and draw lines showing how this should be done. You will soon find yourself landed in difficulties.

252.—A PUZZLE FOR MOTORISTS.

Eight motorists drove to church one morning. Their respective houses and churches, together with the only roads available (the dotted lines), are shown. One went from his house A to his church A, another from his house B to his church B, another from C to C, and so on, but it was afterwards found that no driver ever crossed the track of another car. Take your pencil and try to trace out their various routes.

253.—A BANK HOLIDAY PUZZLE.

Two friends were spending their bank holiday on a cycling trip. Stopping for a rest at a village inn, they consulted a route map, which is represented in our illustration in an exceedingly simplified form, for the puzzle is interesting enough without all the original complexities. They started from the town in the top left-hand corner marked A. It will be seen that there are one hundred and twenty such towns, all connected by straight roads. Now they discovered that there are exactly 1,365 different routes by which they may reach their destination, always travelling either due south or due east. The puzzle is to discover which town is their destination.

Of course, if you find that there are more than 1,365 different routes to a town it cannot be the right one.

254.—THE MOTOR-CAR TOUR.

In the above diagram the circles represent towns and the lines good roads. In just how many different ways can a motorist, starting from London (marked with an L), make a tour of all these towns, visiting every town once, and only once, on a tour, and always coming back to London on the last ride? The exact reverse of any route is not counted as different.

255.—THE LEVEL PUZZLE.

This is a simple counting puzzle. In how many different ways can you spell out the word LEVEL by placing the point of your pencil on an L and then passing along the lines from letter to letter. You may go in any direction, backwards or forwards. Of course you are not allowed to miss letters—that is to say, if you come to a letter you must use it.

256.—THE DIAMOND PUZZLE.

IN how many different ways may the word DIAMOND be read in the arrangement shown? You may start wherever you like at a D and go up or down, backwards or forwards, in and out, in any direction you like, so long as you always pass from one letter to another that adjoins it. How many ways are there?

257.—THE DEIFIED PUZZLE.

In how many different ways may the word DEIFIED be read in this arrangement under the same conditions as in the last puzzle, with the addition that you can use any letters twice in the same reading?

258.—THE VOTERS' PUZZLE.

Here we have, perhaps, the most interesting form of the puzzle. In how many different ways can you read the political injunction, "RISE TO VOTE, SIR," under the same conditions as before? In this case every reading of the palindrome requires the use of the central V as the middle letter.

259.—HANNAH'S PUZZLE.

A man was in love with a young lady whose Christian name was Hannah. When he asked her to be his wife she wrote down the letters of her name in this manner:—

and promised that she would be his if he could tell her correctly in how many different ways it was possible to spell out her name, always passing from one letter to another that was adjacent. Diagonal steps are here allowed. Whether she did this merely to tease him or to test his cleverness is not recorded, but it is satisfactory to know that he succeeded. Would you have been equally successful? Take your pencil and try. You may start from any of the H's and go backwards or forwards and in any direction, so long as all the letters in a spelling are adjoining one another. How many ways are there, no two exactly alike?

260.—THE HONEYCOMB PUZZLE.

Here is a little puzzle with the simplest possible conditions. Place the point of your pencil on a letter in one of the cells of the honeycomb, and trace out a very familiar proverb by passing always from a cell to one that is contiguous to it. If you take the right route you will have visited every cell once, and only once. The puzzle is much easier than it looks.

261.—THE MONK AND THE BRIDGES.

In this case I give a rough plan of a river with an island and five bridges. On one side of the river is a monastery, and on the other side is seen a monk in the foreground. Now, the monk has decided that he will cross every bridge once, and only once, on his return to the monastery. This is, of course, quite easy to do, but on the way he thought to himself, "I wonder how many different routes there are from which I might have selected." Could you have told him? That is the puzzle. Take your pencil and trace out a route that will take you once over all the five bridges. Then trace out a second route, then a third, and see if you can count all the variations. You will find that the difficulty is twofold: you have to avoid dropping routes on the one hand and counting the same routes more than once on the other.

COMBINATION AND GROUP PROBLEMS.

"A combination and a form indeed."
Hamlet, iii. 4.

Various puzzles in this class might be termed problems in the "geometry of situation," but their solution really depends on the theory of combinations which, in its turn, is derived directly from the theory of permutations. It has seemed convenient to include here certain group puzzles and enumerations that might, perhaps, with equal reason have been placed elsewhere; but readers are again asked not to be too critical about the classification, which is very difficult and arbitrary. As I have included my problem of "The Round Table" (No. 273), perhaps a few remarks on another well-known problem of the same class, known by the French as La Problême des Ménages, may be interesting. If n married ladies are seated at a round table in any determined order, in how many different ways may their n husbands be placed so that every man is between two ladies but never next to his own wife?

This difficult problem was first solved by Laisant, and the method shown in the following table is due to Moreau:—

4 0 2 5 3 13 6 13 80 7 83 579 8 592 4738 9 4821 43387 10 43979 439792

The first column shows the number of married couples. The numbers in the second column are obtained in this way: 5 × 3 + 0 - 2 = 13; 6 × 13 + 3 + 2 = 83; 7 × 83 + 13 - 2 = 592; 8 × 592 + 83 + 2 = 4821; and so on. Find all the numbers, except 2, in the table, and the method will be evident. It will be noted that the 2 is subtracted when the first number (the number of couples) is odd, and added when that number is even. The numbers in the third column are obtained thus: 13 - 0 = 13; 83 - 3 = 80; 592 - 13 = 579; 4821 - 83 = 4738; and so on. The numbers in this last column give the required solutions. Thus, four husbands may be seated in two ways, five husbands may be placed in thirteen ways, and six husbands in eighty ways.

The following method, by Lucas, will show the remarkable way in which chessboard analysis may be applied to the solution of a circular problem of this kind. Divide a square into thirty-six cells, six by six, and strike out all the cells in the long diagonal from the bottom left-hand corner to the top right-hand corner, also the five cells in the diagonal next above it and the cell in the bottom right-hand corner. The answer for six couples will be the same as the number of ways in which you can place six rooks (not using the cancelled cells) so that no rook shall ever attack another rook. It will be found that the six rooks may be placed in eighty different ways, which agrees with the above table.

262.—THOSE FIFTEEN SHEEP.

A certain cyclopædia has the following curious problem, I am told: "Place fifteen sheep in four pens so that there shall be the same number of sheep in each pen." No answer whatever is vouchsafed, so I thought I would investigate the matter. I saw that in dealing with apples or bricks the thing would appear to be quite impossible, since four times any number must be an even number, while fifteen is an odd number. I thought, therefore, that there must be some quality peculiar to the sheep that was not generally known. So I decided to interview some farmers on the subject. The first one pointed out that if we put one pen inside another, like the rings of a target, and placed all sheep in the smallest pen, it would be all right. But I objected to this, because you admittedly place all the sheep in one pen, not in four pens. The second man said that if I placed four sheep in each of three pens and three sheep in the last pen (that is fifteen sheep in all), and one of the ewes in the last pen had a lamb during the night, there would be the same number in each pen in the morning. This also failed to satisfy me.

The third farmer said, "I've got four hurdle pens down in one of my fields, and a small flock of wethers, so if you will

1 ... 21 22 23 24 25 26 27 28 29 ... 87
Go to page:

Free ebook «Amusements in Mathematics by Henry Ernest Dudeney (e books for reading txt) 📖» - read online now

Comments (0)

There are no comments yet. You can be the first!
Add a comment