Remember that the second kayle-pin must be removed before you begin to play, and that if you knock down two at once those two must be close together, because in the real game the ball could not do more than this.
There is a story of Prince Henry, son of William the Conqueror, afterwards Henry I., that is so frequently recorded in the old chronicles that it is doubtless authentic. The following version of the incident is taken from Hayward'sLife of William the Conqueror, published in 1613—
"Towards the end of his reigne he appointed his two sonnes Robert and Henry, with joynt authoritie, governours of Normandie;the one to suppresse either the insolence or levitie of the other. These went together to visit the French king lying at Constance: where, entertaining the time with varietie of disports, Henry played with Louis, then Daulphine of France, at chesse, and did win of him very much.
"Hereat Louis beganne to growe warme in words, and was therein little respected by Henry. The great impatience of the one and the small forbearance of the other did strike in the end such a heat between them that Louis threw the chessmen at Henry's face.
"Henry again stroke Louis with the chessboard, drew blood with the blowe, and had presently slain him upon the place had he not been stayed by his brother Robert.
"Hereupon they presently went to horse, and their spurres claimed so good haste as they recovered Pontoise, albeit they were sharply pursued by the French."
Now, tradition—on this point not trustworthy—says that the chessboard broke into the thirteen fragments shown in our illustration. It will be seen that there are twelve pieces, all different in shape, each containing five squares, and one little piece of four squares only.
We thus have all the sixty-four squares of the chess-board, and the puzzle is simply to cut them out and fit them together, so as to make a perfect board properly chequered. The pieces may be easily cut out of a sheet of "squared" paper, and, if mounted on cardboard, they will form a source of perpetual amusement in the home.
If you succeed in constructing the chessboard, but do not record the arrangement, you will find it just as puzzling the next time you feel disposed to attack it.
Prince Henry himself, with all his skill and learning, would have found it an amusing pastime.
Inside a rectangular room, measuring 30 feet in length and 12 feet in width and height, a spider is at a point on the middle of one of the end walls, 1 foot from the ceiling, as at A; and a fly is on the opposite wall, 1 foot from the floor in the centre, as shownat B. What is the shortest distance that the spider must crawl in order to reach the fly, which remains stationary? Of course the spider never drops or uses its web, but crawls fairly.
Here is a little puzzle culled from the traditions of an old monastery in the west of England. Abbot Francis, it seems, was a very worthy man; and his methods of equity extended to those little acts of charity for which he was noted for miles round.
The Abbot, moreover, had a fine taste in wines. On one occasion he sent for the cellarman, and complained that a particular bottling was not to his palate.
"Pray tell me, Brother John, how much of this wine thou didst bottle withal."
"A fair dozen in large bottles, my lord abbot, and the like in the small," replied the cellarman, "whereof five of each have been drunk in the refectory."
"So be it. There be three varlets waiting at the gate. Let the two dozen bottles be given unto them, both full and empty; and see that the dole be fairly made, so that no man receive more wine than another, nor any difference in bottles."
Poor John returned to his cellar, taking the three men with him, and then his task began to perplex him. Of full bottles he had seven large and seven small, and of empty bottles five large and five small, as shown in the illustration. How was he to make the required equitable division?
He divided the bottles into three groups in several ways that at first sight seemed to be quite fair, since two small bottles held just the same quantity of wine as one large one. But the large bottles themselves, when empty, were not worth two small ones.
Hence the abbot's order that each man must take away the same number of bottles of each size.
Finally, the cellarman had to consult one of the monks who was good at puzzles of this kind, and who showed him how the thing was done. Can you find out just how the distribution was made?
A good dissection puzzle in so few as two pieces is rather a rarity, so perhaps the reader will be interested in the following. The diagram represents a piece of bunting, and it is required to cut it into two pieces (without any waste) that will fit together and form a perfectly square flag, with the four roses symmetricallyplaced. This would be easy enough if it were not for the four roses, as we should merely have to cut from A to B, and insert the piece at the bottom of the flag. But we are not allowed to cut through any of the roses, and therein lies the difficulty of the puzzle. Of course we make no allowance for "turnings."
In the illustration Hendrick and Katrün are seen engaged in the exhilarating sport of attempting the capture of a couple of hogs.
Why did they fail?
Strange as it may seem, a complete answer is afforded in the little puzzle game that I will now explain.
Copy the simple diagram on a conveniently large sheet of cardboard or paper, and use four marked counters to represent the Dutchman, his wife, and the two hogs.
At the beginning of the game these must be placed on the squares on which they are shown. One player represents Hendrick and Katrün, and the other the hogs. The first player moves the Dutchman and his wife one square each in any direction (but not diagonally), and then the second player moves both pigs one square each (not diagonally); and so on, in turns, until Hendrick catches one hog and Katrün the other.
This you will find would be absurdly easy if the hogs moved first, but this is just what Dutch pigs will not do.
This is a game that used to be (and may be to this day, for aught I know) a favourite means of swindling employed by card-sharpers at racecourses and in railway carriages.
As, on its own merits, however, the game is particularly interesting, I will make no apology for presenting it to my readers.
The cardsharper lays down the twenty-four cards shown in the illustration, and invites the innocent wayfarer to try his luck or skill by seeing which of them can first score thirty-one, or drive his opponent beyond, in the following manner:—
One player turns down a card, say a 2, and counts "two"; the second player turns down a card, say a 5, and, adding this to the score, counts "seven"; the first player turns down another card, say a 1, and counts "eight"; and so the play proceeds alternately until one of them scores the "thirty-one," and so wins.
Now, the question is, in order to win, should you turn down the first card, or courteously request your opponent to do so? And how should you conduct your play? The reader will perhaps say: "Oh, that is easy enough. You must play first, and turn down a 3; then, whatever your opponent does, he cannot stop your makingten, or stop your making seventeen, twenty-four, and the winning thirty-one. You have only to secure these numbers to win."
But this is just that little knowledge which is such a dangerous thing, and it places you in the hands of the sharper.
You play 3, and the sharper plays 4 and counts "seven"; you play 3 and count "ten"; the sharper turns down 3 and scores "thirteen"; you play 4 and count "seventeen"; the sharper plays a 4 and counts "twenty-one"; you play 3 and make your "twenty-four."
Now the sharper plays the last 4 and scores "twenty-eight." You look in vain for another 3 with which to win, for they are all turned down! So you are compelled either to let him make the "thirty-one" or to go yourself beyond, and so lose the game.
You thus see that your method of certainly winning breaks down utterly, by what may be called the "method of exhaustion."I will give the key to the game, showing how you may always win; but I will not here say whether you must play first or second: you may like to find it out for yourself.
Our illustration shows the plan of a Chinese city protected by pentagonal fortifications. Five European Powers were scheming and clamouring for a concession to run a railway to the place; and at last one of the Emperor's more brilliant advisers said, "Let every one of them have a concession!" So the Celestial Government officials were kept busy arranging the details. The letters in the diagram show the different nationalities, and indicate not only just where each line must enter the city, but also where the station belonging to that line must be located. As it was agreed that the line of one company must never cross the line of another, the representatives of the various countries concerned were engaged so many weeks in trying to find a solution to the problem, that in the meantime a change in the Chinese Government was brought about, and the whole scheme fell through. Take your pencil and trace out the route for the line A to A, B to B, C to C, and so on, without ever allowing one line to cross another or pass through another company's station.
This illustration represents a troupe of clowns I once saw on the Continent. Each clown bore one of the numbers 1 to 9 on his body. After going through the usual tumbling, juggling, and other antics, they generally concluded with a few curious little numerical tricks, one of which was the rapid formation of a number of magic squares. It occurred to me that if clown No. 1 failed to appear (as happens in the illustration), this last item of their performance might not be so easy. The reader is asked to discover how these eight clowns may arrange themselves in the form of a square (one place being vacant), so that every one of the three columns, three rows, and each of the two diagonals shall add up the same. The vacant place may be at any part of the square, but it is No. 1 that must be absent.
Once upon a time a knight went to consult a certain famous wizard. The interview had to do with an affair of the heart; but after the man of magic had foretold the most favourable issues, and concocted a love-potion that was certain to help his visitor's cause, the conversation drifted on to occult subjects generally.
"And art thou learned also in the magic of numbers?" asked the knight. "Show me but one sample of thy wit in these matters."
The old wizard took five blocks bearing numbers, and placed them on a shelf, apparently at random, so that they stood in the order 41096, as shown in our illustration. He then took in his hands an 8 and a 3, and held them together to form the number 83.
"Sir Knight, tell me," said the wizard, "canst thou multiply one number into the other in thy mind?"
"Nay, of a truth," the good knight replied. "I should need to set out upon the task with pen and scrip."
"Yet mark ye how right easy a thing it is to a man learned in the lore of far Araby, who knoweth all the magic that is hid in the philosophy of numbers!"
The wizard simply placed the 3 next to the 4 on the shelf, and the 8 at the other end. It will be found that this gives the answer quite correctly—3410968. Very curious, is it not? How many other two-figure multipliers can you find that will produce the same effect? You may place just as many blocks as you like on the shelf, bearing any figures you choose.
If we take the ribbon by the ends and pull it out straight, we have the number 0588235294117647. This number has the peculiarity that, if we multiply it by any one of the numbers, 2, 3, 4, 5,6, 7, 8, or 9, we get exactly the same number in the circle, starting from a different place. For example, multiply by 4, and the product is 2352941176470588, which starts from the dart in the circle. So, if we multiply by 3, we get the same result starting from the star. Now, the puzzle is to place a different arrangement of figures on the ribbon that will produce similar results when so multiplied; only the 0 and the 7 appearing at the ends of the ribbon must not be removed.
Three Japanese ladies possessed a square ancestral carpet of considerable intrinsic value, but treasured also as an interesting heirloom in the family. They decided to cut it up and make three square rugs of it, so that each should possess a share in her own house.
One lady suggested that the simplest way would be for her to take a smaller share than the other two, because then the carpet need not be cut into more than four pieces.
There are three easy ways of doing this, which I will leave the reader for the present the amusement of finding for himself, merely saying that if you suppose the carpet to be nine square feet, then one lady may take a piece two feet square whole, another a two feet square in two pieces, and the third a square foot whole.
But this generous offer would not for a moment be entertained by the other two sisters, who insisted that the square carpet should be so cut that each should get a square mat of exactly the same size.
Now, according to the best Western authorities, they would have found it necessary to cut the carpet into seven pieces; but a correspondent in Tokio assures me that the legend is that they did it in as few as six pieces, and he wants to know whether such a thing is possible.
Yes; it can be done.
Can you cut out the six pieces that will form three square mats of equal size?
That eminent and more or less veracious traveller Captain Longbow has a great grievance with the public. He claims that during a recent expedition in Arctic regions he actually reached the North Pole, but cannot induce anybody to believe him. Of course, the difficulty in such cases is to produce proof, but he avers that future travellers, when they succeed in accomplishing the same feat, will find evidence on the spot. He says that when he got there he saw a bear going round and round the top of the pole (which he declaresisa pole), evidently perplexed by the peculiar fact that no matter in what direction he looked it was always due south. Captain Longbow put an end to the bear's meditations by shooting him, and afterwards impaling him, in the manner shown in theillustration, as the evidence for future travellers to which I have alluded.
When the Captain got one hundred miles south on his return journey he had a little experience that is somewhat puzzling. He was surprised one morning, on looking down from an elevation, to see no fewer than eleven bears in his immediate vicinity. But what astonished him more than anything else was the curious fact that they had so placed themselves that there were seven rows of bears, with four bears in every row. Whether or not this was the result of pure accident he cannot say, but such a thing might have happened. If the reader tries to make eleven dots on a sheet of paper so that there shall be seven rows of dots with four dots in every row, he will find some difficulty; but the captain's alleged grouping of the bears is quite possible. Can you discover how they were arranged?
This puzzle has to do with railway routes, and in these days of much travelling should prove useful. The map of England shows twenty-four towns, connected by a system of railways. A resident at the town marked A at the top of the map proposes to visit every one of the towns once and only once, and to finish up his tour at Z. This would be easy enough if he were able to cut across country by road, as well as by rail, but he is not. How does he perform the feat? Take your pencil and, starting from A, pass from town to town, making a dot in the towns you have visited, and see if you can end at Z.
Here is a puzzle that was once on sale in the London shops. It represents a military train—an engine and eight cars. Thepuzzle is to reverse the cars, so that they shall be in the order 8, 7, 6, 5, 4, 3, 2, 1, instead of 1, 2, 3, 4, 5, 6, 7, 8, with the engine left, as at first, on the side track. Do this in the fewest possible moves. Every time the engine or a car is moved from the main to the side track, orvice versa, it counts a move for each car or engine passed over one of the points. Moves along the main track are not counted. With 8 at the extremity, as shown, there is just room to pass 7 on to the side track, run 8 up to 6, and bring down 7 again; or you can put as many as five cars, or four and the engine, on the siding at the same time. The cars move without the aid of the engine. The purchaser is invited to "try to do it in 20 moves." How many do you require?
Mrs. Covey, who keeps a little poultry farm in Surrey, is one of the most eccentric women I ever met. Her manner of doing business is always original, and sometimes quite weird and wonderful. She was once found explaining to a few of her choice friends how she had disposed of her day's eggs. She had evidently got the idea from an old puzzle with which we are all familiar; but as it is an improvement on it, I have no hesitation in presenting it to my readers. She related that she had that day taken a certain number of eggs to market. She sold half of them to one customer, and gave him half an egg over. She next sold a third of what she had left, and gave a third of an egg over. She then sold a fourth of the remainder, and gave a fourth of an egg over. Finally,she disposed of a fifth of the remainder, and gave a fifth of an egg over. Then what she had left she divided equally among thirteen of her friends. And, strange to say, she had not throughout all these transactions broken a single egg. Now, the puzzle is to find the smallest possible number of eggs that Mrs. Covey could have taken to market. Can you say how many?
Select the name of any flower that you think suitable, and that contains eight letters. Touch one of the primroses with your pencil and jump over one of the adjoining flowers to another, on which you mark the first letter of your word. Then touch another vacant flower, and again jump over one in another direction, and write down the second letter. Continue this (taking the letters in their proper order) until all the letters have been written down, and the original word can be correctly read round the garland. You must always touch an unoccupied flower, but the flower jumpedover may be occupied or not. The name of a tree may also be selected. Only English words may be used.
Seven friends, named Adams, Brooks, Cater, Dobson, Edwards, Fry, and Green, were spending fifteen days together at the seaside, and they had a round breakfast table at the hotel all to themselves. It was agreed that no man should ever sit down twice with the same two neighbours. As they can be seated, under these conditions, in just fifteen ways, the plan was quite practicable. But could the reader have prepared an arrangement for every sitting? The hotel proprietor was asked to draw up a scheme, but he miserably failed.
Sometimes people will speak of mere counting as one of the simplest operations in the world; but on occasions, as I shall show, it is far from easy. Sometimes the labour can be diminished by the use of little artifices; sometimes it is practically impossible to make the required enumeration without having a very clear head indeed. An ordinary child, buying twelve postage stamps, will almost instinctively say, when he sees there are four along one side and three along the other, "Four times three are twelve;" while his tiny brother will count them all in rows, "1, 2, 3, 4," etc. If the child's mother has occasion to add up the numbers 1, 2, 3, up to 50, she will most probably make a long addition sum of the fifty numbers; while her husband, more used to arithmetical operations, will see at a glance that by joining the numbers at the extremes there are 25 pairs of 51; therefore, 25×51=1,275. But his smart son of twenty may go one better and say, "Why multiply by 25? Just add two 0's to the 51 and divide by 4, and there you are!"
A tea merchant has five tin tea boxes of cubical shape, which he keeps on his counter in a row, as shown in our illustration. Every box has a picture on each of its six sides, so there are thirtypictures in all; but one picture on No. 1 is repeated on No. 4, and two other pictures on No. 4 are repeated on No. 3. There are, therefore, only twenty-seven different pictures. The owner always keeps No. 1 at one end of the row, and never allows Nos. 3 and 5 to be put side by side.
The tradesman's customer, having obtained this information, thinks it a good puzzle to work out in how many ways the boxes may be arranged on the counter so that the order of the five pictures in front shall never be twice alike. He found the making of the count a tough little nut. Can you work out the answer without getting your brain into a tangle? Of course, two similar pictures may be in a row, as it is all a question of their order.
The four pigs are so placed, each in a separate sty, that although every one of the thirty-six sties is in a straight line (either horizontally, vertically, or diagonally), with at least one of the pigs,yet no pig is in line with another. In how many different ways may the four pigs be placed to fulfil these conditions? If you turn this page round you get three more arrangements, and if you turn it round in front of a mirror you get four more. These are not to be counted as different arrangements.
The children in the illustration have found that a large number of very interesting and instructive puzzles may be made out of number blocks; that is, blocks bearing the ten digits or Arabic figures—1, 2, 3, 4, 5, 6, 7, 8, 9, and 0. The particular puzzle that they have been amusing themselves with is to divide the blocks into two groups of five, and then so arrange them in the form of two multiplication sums that one product shall be the same as the other. The number of possible solutions is very considerable, but they have hit on that arrangement that gives the smallest possible product. Thus, 3,485 multiplied by 2 is 6,970, and 6,970 multipliedby 1 is the same. You will find it quite impossible to get any smaller result.
Now, my puzzle is to find the largest possible result. Divide the blocks into any two groups of five that you like, and arrange them to form two multiplication sums that shall produce the same product and the largest amount possible. That is all, and yet it is a nut that requires some cracking. Of course, fractions are not allowed, nor any tricks whatever. The puzzle is quite interesting enough in the simple form in which I have given it. Perhaps it should be added that the multipliers may contain two figures.
Here is a little puzzle of the moving counters class that my readers will probably find entertaining. Make a diagram of any convenient size similar to that shown in our illustration, and provide six counters—three marked to represent foxes and three torepresent geese. Place the geese on the discs 1, 2, and 3, and the foxes on the discs numbered 10, 11, and 12
Now the puzzle is this. By moving one at a time, fox and goose alternately, along a straight line from one disc to the next one, try to get the foxes on 1, 2, and 3, and the geese on 10, 11, and 12—that is, make them exchange places—in the fewest possible moves.
But you must be careful never to let a fox and goose get within reach of each other, or there will be trouble. This rule, you will find, prevents you moving the fox from 11 on the first move, as on either 4 or 6 he would be within reach of a goose. It also prevents your moving a fox from 10 to 9, or from 12 to 7. If you play 10 to 5, then your next move may be 2 to 9 with a goose, which you could not have played if the fox had not previously gone from 10. It is perhaps unnecessary to say that only one fox or one goose can be on a disc at the same time. Now, what is the smallest number of moves necessary to make the foxes and geese change places?
Here is a curious extract from Robinson Crusoe's diary. It is not to be found in the modern editions of the Adventures, and is omitted in the old. This has always seemed to me to be a pity.
"The third day in the morning, the wind having abated during the night, I went down to the shore hoping to find a typewriter and other useful things washed up from the wreck of the ship; but all that fell in my way was a piece of timber with many holes in it. My man Friday had many times said that we stood sadly in need of a square table for our afternoon tea, and I bethought me how this piece of wood might be used for that purpose. And since during the long time that Friday had now been with me I was not wanting to lay a foundation of useful knowledge in his mind, I told him that it was my wish to make the table from the timber I had found, without there being any holes in the top thereof.
"Friday was sadly put to it to say how this might be, moreespecially as I said it should consist of no more than two pieces joined together; but I taught him how it could be done in such a way that the table might be as large as was possible, though, to be sure, I was amused when he said, 'My nation do much better: they stop up holes, so pieces sugars not fall through.'"
Now, the illustration gives the exact proportion of the piece of wood with the positions of the fifteen holes. How did Robinson Crusoe make the largest possible square table-top in two pieces, so that it should not have any holes in it?
In the county of Devon, where the cider comes from, fifteen of the inhabitants of a village are imbued with an excellent spirit of friendly rivalry, and a few years ago they decided to settle by actual experiment a little difference of opinion as to the cultivation of apple trees. Some said they want plenty of light and air, while others stoutly maintained that they ought to be plantedpretty closely, in order that they might get shade and protection from cold winds. So they agreed to plant a lot of young trees, a different number in each orchard, in order to compare results.
One man had a single tree in his field, another had two trees, another had three trees, another had four trees, another five, and so on, the last man having as many as fifteen trees in his little orchard. Last year a very curious result was found to have come about. Each of the fifteen individuals discovered that every tree in his own orchard bore exactly the same number of apples. But, what was stranger still, on comparing notes they found that the total gathered in every allotment was almost the same. In fact, if the man with eleven trees had given one apple to the man who had seven trees, and the man with fourteen trees had given three each to the men with nine and thirteen trees, they would all have had exactly the same.
Now, the puzzle is to discover how many apples each would have had (the same in every case) if that little distribution had been carried out. It is quite easy if you set to work in the right way.
When I paid a visit to Peckham recently I found everybody asking, "What has happened to Sam Solders, the plumber?" He seemed to be in a bad way, and his wife was seriously anxious about the state of his mind. As he had fitted up a hot-water apparatus for me some years ago which did not lead to an explosion for at least three months (and then only damaged the complexion of one of the cook's followers), I had considerable regard for him.
"There he is," said Mrs. Solders, when I called to inquire. "That's how he's been for three weeks. He hardly eats anything, and takes no rest, whilst his business is so neglected that I don't know what is going to happen to me and the five children. All day long—and night too—there he is, figuring and figuring, and tearing his hair like a mad thing. It's worrying me into an early grave."
I persuaded Mrs. Solders to explain matters to me. It seems that he had received an order from a customer to make two rectangular zinc cisterns, one with a top and the other without a top. Each was to hold exactly 1,000 cubic feet of water when filled to the brim. The price was to be a certain amount per cistern, including cost of labour. Now Mr. Solders is a thrifty man, so he naturally desired to make the two cisterns of such dimensions that the smallest possible quantity of metal should be required. This was the little question that was so worrying him.
Can my ingenious readers find the dimensions of the most economical cistern with a top, and also the exact proportions of such a cistern without a top, each to hold 1,000 cubic feet of water? By "economical" is meant the method that requires the smallest possible quantity of metal. No margin need be allowed for what ladies would call "turnings." I shall show how I helped Mr. Solders out of his dilemma. He says: "That little wrinkle you gave me would be useful to others in my trade."
During a Nelson celebration I was standing in Trafalgar Square with a friend of puzzling proclivities. He had for some time been gazing at the column in an abstracted way, and seemed quite unconscious of the casual remarks that I addressed to him.
"What are you dreaming about?" I said at last.
"Two feet——" he murmured.
"Somebody's Trilbys?" I inquired.
"Five times round——"
"Two feet, five times round! What on earth are you saying?"
"Wait a minute," he said, beginning to figure something out on the back of an envelope. I now detected that he was in the throes of producing a new problem of some sort, for I well knew his methods of working at these things.
"Here you are!" he suddenly exclaimed. "That's it! A very interesting little puzzle. The height of the shaft of the Nelson column being 200 feet and its circumference 16 feet 8 inches, it is wreathed in a spiral garland which passes round it exactly five times. What is the length of the garland? It looks rather difficult, but is really remarkably easy."
He was right. The puzzle is quite easy if properly attacked. Of course the height and circumference are not correct, but chosen for the purposes of the puzzle. The artist has also intentionally drawn the cylindrical shaft of the column of equal circumference throughout. If it were tapering, the puzzle would be less easy.
A country baker sent off his boy with a message to the butcher in the next village, and at the same time the butcher sent his boy to the baker. One ran faster than the other, and they were seen to pass at a spot 720 yards from the baker's shop. Each stopped ten minutes at his destination and then started on the return journey, when it was found that they passed each other at a spot 400 yards from the butcher's. How far apart are the two tradesmen's shops? Of course each boy went at a uniform pace throughout.
Thirteen youngsters were seen dancing in a ring on the Ramsgate sands. Apparently they were playing "Round the Mulberry Bush." The puzzle is this. How many rings may they form without any child ever taking twice the hand of any other child—right hand or left? That is, no child may ever have a second time the same neighbour.
Pope has told us that all chance is but "direction which thou canst not see," and certainly we all occasionally come across remarkablecoincidences—little things against the probability of the occurrence of which the odds are immense—that fill us with bewilderment. One of the three motor men in the illustration has just happened on one of these queer coincidences. He is pointing out to his two friends that the three numbers on their cars contain all the figures 1 to 9 and 0, and, what is more remarkable, that if the numbers on the first and second cars are multiplied together they will make the number on the third car. That is, 78, 345, and 26,910 contain all the ten figures, and 78 multiplied by 345 makes 26,910. Now, the reader will be able to find many similar sets of numbers of two, three, and five figures respectively that have the same peculiarity. But there is one set, and one only, in which the numbers have this additional peculiarity—that the second number is a multiple of the first. In other words, if 345 could be divided by 78 without a remainder, the numbers on the carswould themselves fulfil this extra condition. What are the three numbers that we want? Remember that they must have two, three, and five figures respectively.
Can you construct a square of sixteen different numbers so that it shall be magic (that is, adding up alike in the four rows, four columns, and two diagonals), whether you turn the diagram upside down or not? You must not use a 3, 4, or 5, as these figures will not reverse; but a 6 may become a 9 when reversed, a 9 a 6, a 7 a 2, and a 2 a 7. The 1, 8, and 0 will read the same both ways. Remember that the constant must not be changed by the reversal.