The names of two U.S. state capitals end with the same eight letters. What are they?
Walter Penney of Greenbelt, Md., offered this poser in the August 1969 issue of Word Ways: The Journal of Recreational Linguistics. Below are five groups of English words. Each group appears also in a foreign language. What are the languages?
- aloud, angel, hark, inner, lover, room, taken, wig
- alas, atlas, into, manner, pore, tie, vain, valve
- ail, ballot, enter, four, lent, lit, mire, taller
- banjo, chosen, hippo, pure, same, share, tempo, tendon
- ago, cur, dare, fur, limes, mane, probe, undo
In projective geometry, every family of parallel straight lines intersects at an infinitely distant point. Chess problem composers in the former Yugoslavia have adapted this idea for the chessboard, adding four special squares “at infinity.”
Now a queen on a bare board, for example, can zoom off to the west (or east) and reach a square “at infinity” from which she attacks every rank on the board simultaneously from both directions. She might also zoom to the north (or south) to reach a different square at infinity; from this one she attacks every file simultaneously, again from both directions. Finally she can zoom to the northwest or southeast and attack all the diagonals parallel to a8-h1, or zoom to the northeast or southwest and attack all the diagonals parallel to a1-h8. These four “infinity squares,” plus the regular board, make up the field of play.
N. Petrovic created the problem below, published in Matematika Na Shahmatnoi Doske. White is to play and mate in at least two moves. Can you find the solution?
A Russian problem from the 1999 Mathematical Olympiad:
A father wants to take his two sons to visit their grandmother, who lives 33 kilometers away. His motorcycle will cover 25 kilometers per hour if he rides alone, but the speed drops to 20 kph if he carries one passenger, and he cannot carry two. Each brother walks at 5 kph. Can the three of them reach grandmother’s house in 3 hours?
From Sam Loyd:
Two children, who were all tangled up in their reckoning of the days of the week, paused on their way to school to straighten matters out.
“When the day after tomorrow is yesterday,” said Priscilla, “then ‘today’ will be as far from Sunday as that day was which was ‘today’ when the day before yesterday was tomorrow!”
On which day of the week did this puzzling prattle occur?
Six boys are accused of stealing apples. Exactly two are guilty. Which two? When the boys are questioned, Harry names Charlie and George, James names Donald and Tom, Donald names Tom and Charlie, George names Harry and Charlie, and Charlie names Donald and James. Tom can’t be found. Four of the boys who were questioned named one guilty boy correctly and one incorrectly, and the fifth lied outright. Who stole the apples?
A group of four missionaries are on one side of a river, and four cannibals are on the other side. The two groups would like to exchange places, but there’s only one rowboat, and it holds only three people, and only one missionary and one cannibal know how to row, and the cannibals will overpower the missionaries as soon as they outnumber them, either on land or in the boat. Can the crossing be accomplished?
A brainteaser by Chris Maslanka:
A packet of sugar retails for 90 cents. Each packet includes a voucher, and nine vouchers can be redeemed for a free packet. What is the value of the contents of one packet? (Ignore the cost of the packaging.)
A variation on yesterday’s puzzle:
Suppose there are six bottles of pills, and more than one of them may contain defective pills that weigh 6 grams instead of 5. How can we identify the bad bottles with a single weighing?
An efficiency-minded pharmacist has just received a shipment of 10 bottles of pills when the manufacturer calls to say that there’s been an error — nine of the bottles contain pills that weigh 5 grams apiece, which is correct, but the pills in the remaining bottle weigh 6 grams apiece. The pharmacist could find the bad batch by simply weighing one pill from each bottle, but he hits on a way to accomplish this with a single weighing. What does he do?
This week’s puzzle has a twist: Imagine that the board has been rolled into a cylinder so that the a- and h-files are joined and pieces can move across the boundary. How can White mate in two moves?
The first 10 letters of the alphabet, ABCDEFGHIJ, form a cipher that conceals the name of a number less than 100. What is the number?
- How does a deaf man indicate to a hardware clerk that he wants to buy a saw?
- How can you aim your car north on a straight road, drive for a hundred yards, and find yourself a hundred yards south of where you started?
- What runs fore to aft on one side of a ship and aft to fore on the other?
- A very fast train travels from City A to City B in an hour and a quarter. But the return trip, made under identical conditions, requires 75 minutes. Why?
- Does Canada have a 4th of July?
- Exhausted, you go to bed at 8 p.m., but you don’t want to miss an appointment at 10 a.m. the next day, so you set your alarm clock for 9. How many hours do you sleep?
Imagine a die that exactly covers one square of a checkerboard. Place the die in the top left corner with the 6 uppermost. Now, by tipping the die over successively onto each new square, can you roll it through each of the board’s 64 squares once and arrive in the upper right, so that the 6 is exposed at the beginning and end but never elsewhere?
In a photograph, is there a way to distinguish between a landscape and its reflection?
n. the distance between two stopping places
Another puzzle by Sam Loyd: Two ferry boats ply the same route between ports on opposite sides of a river. They set out simultaneously from opposite ports, but one is faster than the other, so they meet at a point 720 yards from the nearest shore. When each boat reaches its destination, it waits 10 minutes to change passengers, then begins its return trip. Now the boats meet at a point 400 yards from the other shore. How wide is the river?
“The problem shows how the average person, who follows the cut-and-dried rules of mathematics, will be puzzled by a simple problem that requires only a slight knowledge of elementary arithmetic. It can be explained to a child, yet I hazard the opinion that ninety-nine out of every hundred of our shrewdest businessmen would fail to solve it in a week. So much for learning mathematics by rule instead of common sense which teaches the reason why!”
Sam Loyd devised this puzzle in 1898. Begin at the heart in the center and move three squares in any of the eight directions, north, south, east, west, northeast, northwest, southeast, or southwest. You’ll land on a number; take this as the length of your next “march,” which again can go in any of the eight directions. “Continue on in this manner until you come upon a square with a number which will carry you just one step beyond the border, thus solving the puzzle.”
Interestingly, Loyd devised this puzzle expressly to defeat Leonhard Euler’s method of solving mazes. “Euler, the great mathematician, discovered a rule for solving all manner of maze puzzles, which, as all good puzzlists know, depends chiefly upon working backwards. This puzzle, however, was built purposely to defeat Euler’s rule and out of many attempts is probably the only one which thwarts his method.” The original puzzle, as published in the New York Journal and Advertiser, contained a flaw that permitted multiple solutions. That’s been corrected here — there’s only one way out.
Two-move chess is just like regular chess except that each side makes two moves at a time. Prove that White, who goes first, can be sure of at least a draw.