[Ill.u.s.tration]
Here is a neat little trick with three dice. I ask you to throw the dice without my seeing them. Then I tell you to multiply the points of the first die by 2 and add 5; then multiply the result by 5 and add the points of the second die; then multiply the result by 10 and add the points of the third die. You then give me the total, and I can at once tell you the points thrown with the three dice. How do I do it? As an example, if you threw 1, 3, and 6, as in the ill.u.s.tration, the result you would give me would be 386, from which I could at once say what you had thrown.
387.--THE VILLAGE CRICKET MATCH.
In a cricket match, Dingley Dell v. All Muggleton, the latter had the first innings. Mr. Dumkins and Mr. Podder were at the wickets, when the wary Dumkins made a splendid late cut, and Mr. Podder called on him to run. Four runs were apparently completed, but the vigilant umpires at each end called, "three short," making six short runs in all. What number did Mr. Dumkins score? When Dingley Dell took their turn at the wickets their champions were Mr. Luffey and Mr. Struggles. The latter made a magnificent off-drive, and invited his colleague to "come along," with the result that the observant spectators applauded them for what was supposed to have been three sharp runs. But the umpires declared that there had been two short runs at each end--four in all. To what extent, if any, did this manoeuvre increase Mr. Struggles"s total?
388.--SLOW CRICKET.
In the recent county match between Wess.e.x and Nincomshire the former team were at the wickets all day, the last man being put out a few minutes before the time for drawing stumps. The play was so slow that most of the spectators were fast asleep, and, on being awakened by one of the officials clearing the ground, we learnt that two men had been put out leg-before-wicket for a combined score of 19 runs; four men were caught for a combined score or 17 runs; one man was run out for a duck"s egg; and the others were all bowled for 3 runs each. There were no extras. We were not told which of the men was the captain, but he made exactly 15 more than the average of his team. What was the captain"s score?
389.--THE FOOTBALL PLAYERS.
"It is a glorious game!" an enthusiast was heard to exclaim. "At the close of last season, of the footballers of my acquaintance four had broken their left arm, five had broken their right arm, two had the right arm sound, and three had sound left arms." Can you discover from that statement what is the smallest number of players that the speaker could be acquainted with?
It does not at all follow that there were as many as fourteen men, because, for example, two of the men who had broken the left arm might also be the two who had sound right arms.
390.--THE HORSE-RACE PUZZLE.
There are no morals in puzzles. When we are solving the old puzzle of the captain who, having to throw half his crew overboard in a storm, arranged to draw lots, but so placed the men that only the Turks were sacrificed, and all the Christians left on board, we do not stop to discuss the questionable morality of the proceeding. And when we are dealing with a measuring problem, in which certain thirsty pilgrims are to make an equitable division of a barrel of beer, we do not object that, as total abstainers, it is against our conscience to have anything to do with intoxicating liquor. Therefore I make no apology for introducing a puzzle that deals with betting.
Three horses--Acorn, Bluebottle, and Capsule--start in a race. The odds are 4 to 1, Acorn; 3 to 1, Bluebottle; 2 to 1, Capsule. Now, how much must I invest on each horse in order to win 13, no matter which horse comes in first? Supposing, as an example, that I betted 5 on each horse. Then, if Acorn won, I should receive 20 (four times 5), and have to pay 5 each for the other two horses; thereby winning 10. But it will be found that if Bluebottle was first I should only win 5, and if Capsule won I should gain nothing and lose nothing. This will make the question perfectly clear to the novice, who, like myself, is not interested in the calling of the fraternity who profess to be engaged in the n.o.ble task of "improving the breed of horses."
391.--THE MOTOR-CAR RACE.
Sometimes a quite simple statement of fact, if worded in an unfamiliar manner, will cause considerable perplexity. Here is an example, and it will doubtless puzzle some of my more youthful readers just a little. I happened to be at a motor-car race at Brooklands, when one spectator said to another, while a number of cars were whirling round and round the circular track:-- "There"s Gogglesmith--that man in the white car!"
"Yes, I see," was the reply; "but how many cars are running in this race?"
Then came this curious rejoinder:-- "One-third of the cars in front of Gogglesmith added to three-quarters of those behind him will give you the answer."
Now, can you tell how many cars were running in the race?
PUZZLE GAMES.
"He that is beaten may be said To lie in honour"s truckle bed." HUDIBRAS.
It may be said generally that a game is a contest of skill for two or more persons, into which we enter either for amus.e.m.e.nt or to win a prize. A puzzle is something to be done or solved by the individual. For example, if it were possible for us so to master the complexities of the game of chess that we could be a.s.sured of always winning with the first or second move, as the case might be, or of always drawing, then it would cease to be a game and would become a puzzle. Of course among the young and uninformed, when the correct winning play is not understood, a puzzle may well make a very good game. Thus there is no doubt children will continue to play "Noughts and Crosses," though I have shown (No. 109, "_Canterbury Puzzles_") that between two players who both thoroughly understand the play, every game should be drawn. Neither player could ever win except through the blundering of his opponent. But I am writing from the point of view of the student of these things.
The examples that I give in this cla.s.s are apparently games, but, since I show in every case how one player may win if he only play correctly, they are in reality puzzles. Their interest, therefore, lies in attempting to discover the leading method of play.
392.--THE PEBBLE GAME.
Here is an interesting little puzzle game that I used to play with an acquaintance on the beach at Slocomb-on-Sea. Two players place an odd number of pebbles, we will say fifteen, between them. Then each takes in turn one, two, or three pebbles (as he chooses), and the winner is the one who gets the odd number. Thus, if you get seven and your opponent eight, you win. If you get six and he gets nine, he wins. Ought the first or second player to win, and how? When you have settled the question with fifteen pebbles try again with, say, thirteen.
393.--THE TWO ROOKS.
This is a puzzle game for two players. Each player has a single rook. The first player places his rook on any square of the board that he may choose to select, and then the second player does the same. They now play in turn, the point of each play being to capture the opponent"s rook. But in this game you cannot play through a line of attack without being captured. That is to say, if in the diagram it is Black"s turn to play, he cannot move his rook to his king"s knight"s square, or to his king"s rook"s square, because he would enter the "line of fire" when pa.s.sing his king"s bishop"s square. For the same reason he cannot move to his queen"s rook"s seventh or eighth squares. Now, the game can never end in a draw. Sooner or later one of the rooks must fall, unless, of course, both players commit the absurdity of not trying to win. The trick of winning is ridiculously simple when you know it. Can you solve the puzzle?
[Ill.u.s.tration]
394.--PUSS IN THE CORNER.
[Ill.u.s.tration]
This variation of the last puzzle is also played by two persons. One puts a counter on No. 6, and the other puts one on No. 55, and they play alternately by removing the counter to any other number in a line. If your opponent moves at any time on to one of the lines you occupy, or even crosses one of your lines, you immediately capture him and win. We will take an ill.u.s.trative game.
A moves from 55 to 52; B moves from 6 to 13; A advances to 23; B goes to 15; A retreats to 26; B retreats to 13; A advances to 21; B retreats to 2; A advances to 7; B goes to 3; A moves to 6; B must now go to 4; A establishes himself at 11, and B must be captured next move because he is compelled to cross a line on which A stands. Play this over and you will understand the game directly. Now, the puzzle part of the game is this: Which player should win, and how many moves are necessary?
395.--A WAR PUZZLE GAME.
[Ill.u.s.tration]
Here is another puzzle game. One player, representing the British general, places a counter at B, and the other player, representing the enemy, places his counter at E. The Britisher makes the first advance along one of the roads to the next town, then the enemy moves to one of his nearest towns, and so on in turns, until the British general gets into the same town as the enemy and captures him. Although each must always move along a road to the next town only, and the second player may do his utmost to avoid capture, the British general (as we should suppose, from the a.n.a.logy of real life) must infallibly win. But how? That is the question.
396.--A MATCH MYSTERY.
Here is a little game that is childishly simple in its conditions. But it is well worth investigation.
Mr. Stubbs pulled a small table between himself and his friend, Mr. Wilson, and took a box of matches, from which he counted out thirty.
"Here are thirty matches," he said. "I divide them into three unequal heaps. Let me see. We have 14, 11, and 5, as it happens. Now, the two players draw alternately any number from any one heap, and he who draws the last match loses the game. That"s all! I will play with you, Wilson. I have formed the heaps, so you have the first draw."
"As I can draw any number," Mr. Wilson said, "suppose I exhibit my usual moderation and take all the 14 heap."
"That is the worst you could do, for it loses right away. I take 6 from the 11, leaving two equal heaps of 5, and to leave two equal heaps is a certain win (with the single exception of 1, 1), because whatever you do in one heap I can repeat in the other. If you leave 4 in one heap, I leave 4 in the other. If you then leave 2 in one heap, I leave 2 in the other. If you leave only 1 in one heap, then I take all the other heap. If you take all one heap, I take all but one in the other. No, you must never leave two heaps, unless they are equal heaps and more than 1, 1. Let"s begin again."
"Very well, then," said Mr. Wilson. "I will take 6 from the 14, and leave you 8, 11, 5."
Mr. Stubbs then left 8, 11, 3; Mr. Wilson, 8, 5, 3; Mr. Stubbs, 6, 5, 3; Mr. Wilson,4, 5, 3; Mr. Stubbs, 4, 5, 1; Mr. Wilson, 4, 3, 1; Mr. Stubbs, 2, 3, 1; Mr. Wilson, 2, 1, 1; which Mr. Stubbs reduced to 1, 1, 1.
"It is now quite clear that I must win," said Mr. Stubbs, because you must take 1, and then I take 1, leaving you the last match. You never had a chance. There are just thirteen different ways in which the matches may be grouped at the start for a certain win. In fact, the groups selected, 14, 11, 5, are a certain win, because for whatever your opponent may play there is another winning group you can secure, and so on and on down to the last match."
397.--THE MONTENEGRIN DICE GAME.
It is said that the inhabitants of Montenegro have a little dice game that is both ingenious and well worth investigation. The two players first select two different pairs of odd numbers (always higher than 3) and then alternately toss three dice. Whichever first throws the dice so that they add up to one of his selected numbers wins. If they are both successful in two successive throws it is a draw and they try again. For example, one player may select 7 and 15 and the other 5 and 13. Then if the first player throws so that the three dice add up 7 or 15 he wins, unless the second man gets either 5 or 13 on his throw.
The puzzle is to discover which two pairs of numbers should be selected in order to give both players an exactly even chance.
398.--THE CIGAR PUZZLE.
I once propounded the following puzzle in a London club, and for a considerable period it absorbed the attention of the members. They could make nothing of it, and considered it quite impossible of solution. And yet, as I shall show, the answer is remarkably simple.
Two men are seated at a square-topped table. One places an ordinary cigar (flat at one end, pointed at the other) on the table, then the other does the same, and so on alternately, a condition being that no cigar shall touch another. Which player should succeed in placing the last cigar, a.s.suming that they each will play in the best possible manner? The size of the table top and the size of the cigar are not given, but in order to exclude the ridiculous answer that the table might be so diminutive as only to take one cigar, we will say that the table must not be less than 2 feet square and the cigar not more than 4 inches long. With those restrictions you may take any dimensions you like. Of course we a.s.sume that all the cigars are exactly alike in every respect. Should the first player, or the second player, win?
MAGIC SQUARE PROBLEMS.
"By magic numbers." CONGREVE, _The Mourning Bride._ This is a very ancient branch of mathematical puzzledom, and it has an immense, though scattered, literature of its own. In their simple form of consecutive whole numbers arranged in a square so that every column, every row, and each of the two long diagonals shall add up alike, these magic squares offer three main lines of investigation: Construction, Enumeration, and Cla.s.sification. Of recent years many ingenious methods have been devised for the construction of magics, and the law of their formation is so well understood that all the ancient mystery has evaporated and there is no longer any difficulty in making squares of any dimensions. Almost the last word has been said on this subject. The question of the enumeration of all the possible squares of a given order stands just where it did over two hundred years ago. Everybody knows that there is only one solution for the third order, three cells by three; and Frenicle published in 1693 diagrams of all the arrangements of the fourth order--880 in number--and his results have been verified over and over again. I may here refer to the general solution for this order, for numbers not necessarily consecutive, by E. Bergholt in Nature, May 26, 1910, as it is of the greatest importance to students of this subject. The enumeration of the examples of any higher order is a completely unsolved problem.
As to cla.s.sification, it is largely a matter of individual taste--perhaps an aesthetic question, for there is beauty in the law and order of numbers. A man once said that he divided the human race into two great cla.s.ses: those who take snuff and those who do not. I am not sure that some of our cla.s.sifications of magic squares are not almost as valueless. However, lovers of these things seem somewhat agreed that Nasik magic squares (so named by Mr. Frost, a student of them, after the town in India where he lived, and also called Diabolique and Pandiagonal) and a.s.sociated magic squares are of special interest, so I will just explain what these are for the benefit of the novice.
[Ill.u.s.tration: SIMPLE]
[Ill.u.s.tration: SEMI-NASIK]
[Ill.u.s.tration: a.s.sOCIATED]
[Ill.u.s.tration: NASIK]
I published in The Queen for January 15, 1910, an article that would enable the reader to write out, if he so desired, all the 880 magics of the fourth order, and the following is the complete cla.s.sification that I gave. The first example is that of a Simple square that fulfils the simple conditions and no more. The second example is a Semi-Nasik, which has the additional property that the opposite short diagonals of two cells each together sum to 34. Thus, 14 + 4 + 11 + 5 = 34 and 12 + 6 + 13 + 3 = 34. The third example is not only Semi-Nasik but also a.s.sociated, because in it every number, if added to the number that is equidistant, in a straight line, from the centre gives 17. Thus, 1 + 16, 2 + 15, 3 + 14, etc. The fourth example, considered the most "perfect" of all, is a Nasik. Here all the broken diagonals sum to 34. Thus, for example, 15 + 14 + 2 + 3, and 10 + 4 + 7 + 13, and 15 + 5 + 2 + 12. As a consequence, its properties are such that if you repeat the square in all directions you may mark off a square, 4 4, wherever you please, and it will be magic.
The following table not only gives a complete enumeration under the four forms described, but also a cla.s.sification under the twelve graphic types indicated in the diagrams. The dots at the end of each line represent the relative positions of those complementary pairs, 1 + 16, 2 + 15, etc., which sum to 17. For example, it will be seen that the first and second magic squares given are of Type VI., that the third square is of Type III., and that the fourth is of Type I. Edouard Lucas indicated these types, but he dropped exactly half of them and did not attempt the cla.s.sification.
NASIK (Type I.) ..... 48 SEMI-NASIK (Type II., Transpositions of Nasik) . 48 " (Type III., a.s.sociated) 48 " (Type IV.) ... 96 " (Type V.) ... 96 192 ___ " (Type VI.) ... 96 384 ___ SIMPLE. (Type VI.) ... 208 " (Type VII.) ... 56 " (Type VIII.)... 56 " (Type IX.) ... 56 " (Type X.) ... 56 224 ___ " (Type XI.) ... 8 " (Type XII.) ... 8 16 448 ___ ___ ___ 880 ___ It is hardly necessary to say that every one of these squares will produce seven others by mere reversals and reflections, which we do not count as different. So that there are 7,040 squares of this order, 880 of which are fundamentally different.
An infinite variety of puzzles may be made introducing new conditions into the magic square. In The Canterbury Puzzles I have given examples of such squares with coins, with postage stamps, with cutting-out conditions, and other tricks. I will now give a few variants involving further novel conditions.
399.--THE TROUBLESOME EIGHT.
Nearly everybody knows that a "magic square" is an arrangement of numbers in the form of a square so that every row, every column, and each of the two long diagonals adds up alike. For example, you would find little difficulty in merely placing a different number in each of the nine cells in the ill.u.s.tration so that the rows, columns, and diagonals shall all add up 15. And at your first attempt you will probably find that you have an 8 in one of the corners. The puzzle is to construct the magic square, under the same conditions, with the 8 in the position shown.
[Ill.u.s.tration]
400.--THE MAGIC STRIPS.
[Ill.u.s.tration]
I happened to have lying on my table a number of strips of cardboard, with numbers printed on them from 1 upwards in numerical order. The idea suddenly came to me, as ideas have a way of unexpectedly coming, to make a little puzzle of this. I wonder whether many readers will arrive at the same solution that I did.
Take seven strips of cardboard and lay them together as above. Then write on each of them the numbers 1, 2, 3, 4, 5, 6, 7, as shown, so that the numbers shall form seven rows and seven columns.
Now, the puzzle is to cut these strips into the fewest possible pieces so that they may be placed together and form a magic square, the seven rows, seven columns, and two diagonals adding up the same number. No figures may be turned upside down or placed on their sides--that is, all the strips must lie in their original direction.
Of course you could cut each strip into seven separate pieces, each piece containing a number, and the puzzle would then be very easy, but I need hardly say that forty-nine pieces is a long way from being the fewest possible.
401.--EIGHT JOLLY GAOL BIRDS.
[Ill.u.s.tration]
The ill.u.s.tration shows the plan of a prison of nine cells all communicating with one another by doorways. The eight prisoners have their numbers on their backs, and any one of them is allowed to exercise himself in whichever cell may happen to be vacant, subject to the rule that at no time shall two prisoners be in the same cell. The merry monarch in whose dominions the prison was situated offered them special comforts one Christmas Eve if, without breaking that rule, they could so place themselves that their numbers should form a magic square.
Now, prisoner No. 7 happened to know a good deal about magic squares, so he worked out a scheme and naturally selected the method that was most expeditious--that is, one involving the fewest possible moves from cell to cell. But one man was a surly, obstinate fellow (quite unfit for the society of his jovial companions), and he refused to move out of his cell or take any part in the proceedings. But No. 7 was quite equal to the emergency, and found that he could still do what was required in the fewest possible moves without troubling the brute to leave his cell. The puzzle is to show how he did it and, incidentally, to discover which prisoner was so stupidly obstinate. Can you find the fellow?
402.--NINE JOLLY GAOL BIRDS.
[Ill.u.s.tration]
Shortly after the episode recorded in the last puzzle occurred, a ninth prisoner was placed in the vacant cell, and the merry monarch then offered them all complete liberty on the following strange conditions. They were required so to rearrange themselves in the cells that their numbers formed a magic square without their movements causing any two of them ever to be in the same cell together, except that at the start one man was allowed to be placed on the shoulders of another man, and thus add their numbers together, and move as one man. For example, No. 8 might be placed on the shoulders of No. 2, and then they would move about together as 10. The reader should seek first to solve the puzzle in the fewest possible moves, and then see that the man who is burdened has the least possible amount of work to do.
403.--THE SPANISH DUNGEON.
Not fifty miles from Cadiz stood in the middle ages a castle, all traces of which have for centuries disappeared. Among other interesting features, this castle contained a particularly unpleasant dungeon divided into sixteen cells, all communicating with one another, as shown in the ill.u.s.tration.
Now, the governor was a merry wight, and very fond of puzzles withal. One day he went to the dungeon and said to the prisoners, "By my halidame!" (or its equivalent in Spanish) "you shall all be set free if you can solve this puzzle. You must so arrange yourselves in the sixteen cells that the numbers on your backs shall form a magic square in which every column, every row, and each of the two diagonals shall add up the same. Only remember this: that in no case may two of you ever be together in the same cell."
One of the prisoners, after working at the problem for two or three days, with a piece of chalk, undertook to obtain the liberty of himself and his fellow-prisoners if they would follow his directions and move through the doorway from cell to cell in the order in which he should call out their numbers.
[Ill.u.s.tration]
He succeeded in his attempt, and, what is more remarkable, it would seem from the account of his method recorded in the ancient ma.n.u.script lying before me, that he did so in the fewest possible moves. The reader is asked to show what these moves were.
404.--THE SIBERIAN DUNGEONS.
[Ill.u.s.tration]
The above is a trustworthy plan of a certain Russian prison in Siberia. All the cells are numbered, and the prisoners are numbered the same as the cells they occupy. The prison diet is so fattening that these political prisoners are in perpetual fear lest, should their pardon arrive, they might not be able to squeeze themselves through the narrow doorways and get out. And of course it would be an unreasonable thing to ask any government to pull down the walls of a prison just to liberate the prisoners, however innocent they might be. Therefore these men take all the healthy exercise they can in order to r.e.t.a.r.d their increasing obesity, and one of their recreations will serve to furnish us with the following puzzle.
Show, in the fewest possible moves, how the sixteen men may form themselves into a magic square, so that the numbers on their backs shall add up the same in each of the four columns, four rows, and two diagonals without two prisoners having been at any time in the same cell together. I had better say, for the information of those who have not yet been made acquainted with these places, that it is a peculiarity of prisons that you are not allowed to go outside their walls. Any prisoner may go any distance that is possible in a single move.
405.--CARD MAGIC SQUARES.
[Ill.u.s.tration]
Take an ordinary pack of cards and throw out the twelve court cards. Now, with nine of the remainder (different suits are of no consequence) form the above magic square. It will be seen that the pips add up fifteen in every row in every column, and in each of the two long diagonals. The puzzle is with the remaining cards (without disturbing this arrangement) to form three more such magic squares, so that each of the four shall add up to a different sum. There will, of course, be four cards in the reduced pack that will not be used. These four may be any that you choose. It is not a difficult puzzle, but requires just a little thought.
406.--THE EIGHTEEN DOMINOES.
The ill.u.s.tration shows eighteen dominoes arranged in the form of a square so that the pips in every one of the six columns, six rows, and two long diagonals add up 13. This is the smallest summation possible with any selection of dominoes from an ordinary box of twenty-eight. The greatest possible summation is 23, and a solution for this number may be easily obtained by subst.i.tuting for every number its complement to 6. Thus for every blank subst.i.tute a 6, for every 1 a 5, for every 2 a 4, for 3 a 3, for 4 a 2, for 5 a 1, and for 6 a blank. But the puzzle is to make a selection of eighteen dominoes and arrange them (in exactly the form shown) so that the summations shall be 18 in all the fourteen directions mentioned.
[Ill.u.s.tration]
SUBTRACTING, MULTIPLYING, AND DIVIDING MAGICS.
Although the adding magic square is of such great antiquity, curiously enough the multiplying magic does not appear to have been mentioned until the end of the eighteenth century, when it was referred to slightly by one writer and then forgotten until I revived it in _t.i.t-Bits_ in 1897. The dividing magic was apparently first discussed by me in The Weekly Dispatch in June 1898. The subtracting magic is here introduced for the first time. It will now be convenient to deal with all four kinds of magic squares together.
[Ill.u.s.tration: ADDING SUBTRACTING MULTIPLYING DIVIDING]
In these four diagrams we have examples in the third order of adding, subtracting, multiplying, and dividing squares. In the first the constant, 15, is obtained by the addition of the rows, columns, and two diagonals. In the second case you get the constant, 5, by subtracting the first number in a line from the second, and the result from the third. You can, of course, perform the operation in either direction; but, in order to avoid negative numbers, it is more convenient simply to deduct the middle number from the sum of the two extreme numbers. This is, in effect, the same thing. It will be seen that the constant of the adding square is n times that of the subtracting square derived from it, where n is the number of cells in the side of square. And the manner of derivation here is simply to reverse the two diagonals. Both squares are "a.s.sociated"--a term I have explained in the introductory article to this department.
The third square is a multiplying magic. The constant, 216, is obtained by multiplying together the three numbers in any line. It is "a.s.sociated" by multiplication, instead of by addition. It is here necessary to remark that in an adding square it is not essential that the nine numbers should be consecutive. Write down any nine numbers in this way-- 1 3 5 4 6 8 7 9 11 so that the horizontal differences are all alike and the vertical differences also alike (here 2 and 3), and these numbers will form an adding magic square. By making the differences 1 and 3 we, of course, get consecutive numbers--a particular case, and nothing more. Now, in the case of the multiplying square we must take these numbers in geometrical instead of arithmetical progression, thus-- 1 3 9 2 6 18 4 12 36 Here each successive number in the rows is multiplied by 3, and in the columns by 2. Had we multiplied by 2 and 8 we should get the regular geometrical progression, 1, 2, 4, 8, 16, 32, 64, 128, and 256, but I wish to avoid high numbers. The numbers are arranged in the square in the same order as in the adding square.
The fourth diagram is a dividing magic square. The constant 6 is here obtained by dividing the second number in a line by the first (in either direction) and the third number by the quotient. But, again, the process is simplified by dividing the product of the two extreme numbers by the middle number. This square is also "a.s.sociated" by multiplication. It is derived from the multiplying square by merely reversing the diagonals, and the constant of the multiplying square is the cube of that of the dividing square derived from it.
The next set of diagrams shows the solutions for the fifth order of square. They are all "a.s.sociated" in the same way as before. The subtracting square is derived from the adding square by reversing the diagonals and exchanging opposite numbers in the centres of the borders, and the constant of one is again n times that of the other. The dividing square is derived from the multiplying square in the same way, and the constant of the latter is the 5th power (that is the nth) of that of the former.
[Ill.u.s.tration]
These squares are thus quite easy for odd orders. But the reader will probably find some difficulty over the even orders, concerning which I will leave him to make his own researches, merely propounding two little problems.