M.C. Escher’s 1935 lithograph Hand With Reflecting Sphere gave artist Kelly M. Houle an idea.
She drew this image in charcoal on a piece of illustration board:
Now when a cylindrical mirror is placed at the center, it produces this reflection:
“When the original image is bent and stretched into a circular swath, the shadows seem to fall in all directions,” she wrote. “When the curved mirror is used to reflect the anamorphic distortion, the forms take on the familiar rules of light and shading that make them seem three-dimensional.”
(Kelly M. Houle, “Portrait of Escher: Behind the Mirror,” in D. Schattschneider and M. Emmer, eds., M.C. Escher’s Legacy, 2003.)
Western Kentucky University geoscientist John All was traversing Nepal’s Mount Himlung in May 2014 when the ice collapsed beneath him and he fell into a crevasse, dislocating his shoulder and breaking some ribs. He landed on a ledge, but now he faced a 70-foot climb back to the surface alone without the use of his right arm or upper leg.
“That’s when I pulled my research camera out and started talking to myself about all my options,” he told National Geographic. “I take photos of everything I do because, if I’m working in Africa and I need to recall a detail, that’s going to be the best way to do it. I was also thinking about my mom and my friends and family and realized that just talking wouldn’t convey what was happening to me nearly as well. So I started recording things.”
“It probably took me four or five hours to climb out,” he said. “I kept moving sideways, slightly up, sideways, slightly up, until I found an area where there was enough hard snow that I could get an ax in and pull myself up and over. I knew that if I fell at any time in that entire four or five hours, I, of course, was going to fall all the way to the bottom of the crevasse. Any mistake, or any sort of rest or anything, I was going to die.”
After reaching the top he rolled as much as walked back to his tent, called for help, and waited 16 hours for a helicopter to arrive. He wrote later, “I had dug myself out of my own grave.”
Mike Keith found this amazing correspondence in 2004. The two 6×6 squares below contain 72 different entries from the periodic table of the elements:
The two squares are equal in three different ways:
If you spell out the name of each element listed (hydrogen, beryllium, etc.), the square on the left is an anagram of the square on the right.
The sum of the atomic numbers of the 36 elements on the left (2019) equals the sum of those on the right.
If you replace each symbol with its alphabetic score (where A=1, B=2, etc.; e.g. Li = L + I = 12 + 9 = 21), then the sum of the scores on the left (737) equals that of those on the right.
Keith writes, “The next largest pair of triply-equal squares like this would be 7×7 in size, containing a total of 98 different elements, [and] it seems quite unlikely that 98 of them could be so arranged. If this is true then the 6×6 pair presented here is the largest possible (at least for now, until many more new chemical elements have been discovered and named).”
This curious game was invented by Princeton mathematician John H. Conway. Two players take turns naming positive integers, but an integer is off limits if it’s the sum of nonnegative multiples of integers that have already been named. Once 1 is named, everything is off limits (because any positive integer is a sum of 1s), so that ends the game; the player who is forced to name 1 is the loser. An example gives the idea:
I start by naming 5. From now on neither of us can name 5, 10, 15, 20, …
You name 4. Now neither of us can name a number built of 5s and 4s, that is, 4, 5, 8, 9, 10, or any number greater than 11.
I name 11. This reduces the list of available numbers to 1, 2, 3, 6, and 7.
You name 6. Now we’re down to 1, 2, 3, and 7.
I name 7. Only 1, 2, and 3 are still available to name.
Now we’ll use our next turns to name 2 and 3, and you’ll be forced to name 1, losing the game.
Though the game is very easy to understand, it’s still full of mysteries. For example, R.L. Hutchings has shown that playing a prime number as the first move guarantees that a winning strategy exists, but no one has figured out how to find the strategy. And no one knows whether there are any winning opening moves at all that aren’t prime.
If you can convince yourself that the front half of this sphere is transparent, and that the image is painted on the interior of the back half, you’ll find that you’re inside the cage, turning to your left, while the birds are outside the cage, looking in at you. (To get started, I find it helps to focus on an edge of the sphere, rather than the center.)
It would take a lot of pencils to work this out by hand, but an insight makes it easy: For any n ≥ 5, n! must have the factors 2 and 5 and hence be a multiple of 10, with zero as a final digit. So to solve the puzzle we only have to work out 1! + 2! + 3! + 4! = 33. The last digit is 3.
(“A Property of Large Factorial Numbers,” Mathematical Gazette 81:490 [March 1997], 80-81.)
In 1930, British explorer Augustine Courtauld volunteered to spend the winter alone on the Greenland ice cap, manning a remote weather station. As the snow gradually buried his hut and his supplies steadily dwindled, his relief party failed to arrive. In this week’s episode of the Futility Closet podcast we’ll follow Courtauld’s increasingly desperate vigil on the ice.
We’ll also retreat toward George III and puzzle over some unexpected evidence.
