“In questions of science, the authority of a thousand is not worth the humble reasoning of a single individual.” — Galileo

# Science & Math

# Blackwell’s Bet

Two envelopes contain unequal sums of money (for simplicity, assume the two amounts are positive integers). The probability distributions are unknown. You choose an envelope at random, open it, and see that it contains *x* dollars. Now you must predict whether the total in the other envelope is more or less than *x*.

Since we know nothing about the other envelope, it would seem we have a 50 percent chance of guessing correctly. But, El Camino College mathematician Leonard Wapner writes, “Unexpectedly, there is something you can do, short of opening the other envelope, to give yourself a better than even chance of getting it right.”

Choose a random positive integer, *d*, by any means at all. (If *d* = *x* then choose again until this isn’t the case.) Now if *d* > *x*, guess more, and if *d* < *x*, guess less. You’ll guess correctly more than 50 percent of the time.

How is this possible? The random number is chosen independently of the envelopes. How can it point in the direction of the unknown *y* most of the time? “Think of it this way,” writes Wapner. “If *d* falls between *x* and *y* then your prediction (as indicated by *d*) is guaranteed to be correct. Assume this occurs with probability *p*. If *d* falls less than both *x* and *y*, then your prediction will be correct only in the event your chosen number *x* is the larger of the two. There is a 50 percent chance of this. Similarly, if *d* is greater than both numbers, your prediction will be correct only if your chosen number is the smaller of the two. This occurs with a 50 percent probability as well.”

So, on balance, your overall probability of being correct is

That’s greater than 0.5, so the odds are in favor of your making a correct prediction.

This example is based on a principle identified by Stanford statistician David Blackwell. “It’s unexpected and ironic that an unrelated random variable can be used to predict that which appears to be completely unpredictable.”

(Leonard M. Wapner, *Unexpected Expectations: The Curiosities of a Mathematical Crystal Ball*, 2012, following David Blackwell, “On the Translation Parameter Problem for Discrete Variables,” *Annals of Mathematical Statistics* 22:3 [1951], 393–399.)

# Presto

Raymond Smullyan offered this proof at a conference on self-reference:

A: Santa Claus exists, if I am not mistaken.

B: Well, of course Santa Claus exists *if you are not mistaken!*

A: So I was right.

B: Yes.

A: So I was not mistaken.

B: Yes.

A: Hence, Santa Claus exists.

# Paean

Proctologist W.C. Bornemeier explains why the sphincter ani must be preserved when performing hemorrhoid surgery:

They say man has succeeded where the animals fail because of the clever use of his hands, yet when compared to the hands, the sphincter ani is far superior. If you place into your cupped hands a mixture of fluid, solid and gas and then through an opening at the bottom, try to let only the gas escape, you will fail. Yet the sphincter ani can do it. The sphincter apparently can differentiate between solid, fluid and gas. It apparently can tell whether its owner is alone or with someone, whether standing up or sitting down, whether its owner has his pants on or off. No other muscle in the body is such a protector of the dignity of man, yet so ready to come to his relief. A muscle like this is worth protecting.

— W.C. Bornemeier, “Sphincter Protecting Hemorrhoidectomy,” *American Journal of Proctology* 11 (1960), 48-52

# The Return of Monty Hall

In 2003, Danish computer scientist Peter Bro Miltersen discussed a surprisingly effective technique by which a player might guess the colors of slips of paper hidden in boxes (PDF). As this circulated in the mathematical community it evolved into a puzzle in which a group of 100 prisoners must find their own names on slips of paper. I wrote about it in 2011.

When Eugene Curtin and Max Warshauer wrote about the prisoner puzzle in *The Mathematical Intelligencer* in December 2006, reader A.S. Landsberg offered a variant called “The Return of Monty Hall.” On a new game show for couples, there are three curtains, which hide a key, a car, and a goat. One member of the couple is the “car-master” — she must find the car. The other is the “key-master” — he must find the key. If both succeed in their tasks, they win the new car. If either fails, they win the goat.

The key-master is led out of the room, where he can’t observe the proceedings, and then the car-master has two tries to find the car (open one curtain, and if the car isn’t there, open another curtain). If she finds the car, then all the curtains are closed again and the key-master is brought on to find the key. No communication at all is permitted between the two at this point. As before, the key-master has two tries to find the key by opening curtains.

If the couple play optimally, their odds of winning the car are a surprising 2/3. They do this using Miltersen’s technique. The car-master is Player #1, the key-master is Player #2, the car is Prize #1, the key is Prize #2, and the goat is Prize #3. The strategy is simply for each player to start by opening the curtain corresponding to his or her own player number, and if unsuccessful to open the curtain number corresponding to the prize number that the first curtain reveals. So, for example, the car-master, who is Player #1, begins by opening Curtain #1. If she finds the car then she’s done; if she finds the key (Prize #2) then she opens Curtain #2, and if she finds the goat (Prize #3) then she opens Curtain #3. When the curtains are reclosed, the key-master begins his turn by opening Curtain #2 (since he’s Player #2) and following the same plan.

That’s it. It’s not guaranteed to work, but it’s a simple strategy that requires minimal preparation and no communication at all once the game has begun. The universe of possibilities is so small that we can simply count them — here are the various arrangements of prizes and the resulting outcomes:

car-key-goat: win

car-goat-key: win

key-goat-car: lose

key-car-goat: win

goat-key-car: win

goat-car-key: lose

Landsberg’s letter brought a comment by reader Eric Grunwald, who pointed out that a third person can be introduced to the Monty Hall game without reducing the overall chance of success. Replace the goat with a GPS system and add a third contestant, the “GPS-master.” Following the same rules, and again forbidding any communication among the contestants, Miltersen’s strategy ensures a 2/3 probability that all three players find their prizes.

# Misc

- Consecutive U.S. presidents Grant, Hayes, and Garfield were all born in Ohio and served as Civil War generals.
- Travel due south from Buffalo and you’ll reach the Pacific Ocean.
- Oliver Wendell Holmes Jr. shook hands with both John Quincy Adams and John F. Kennedy.
- This false statement is not self-referential.
- “When you have no basis for an argument, abuse the plaintiff.” — Cicero

In the 2004 film *Shark Tale*, the shark Lenny coughs up several items onto a table. Among them is a Louisiana license plate, number 007 0 981. The same plate is retrieved from sharks in both *Jaws* and *Deep Blue Sea*.

# The One-Seventh Ellipse

The decimal expansion of 1/7 is 0.142857142857 …, a repeating decimal. Arrange the six repeating digits into overlapping ordered pairs, like so:

(1, 4), (4, 2), (2, 8), (8, 5), (5, 7) (7, 1),

and, remarkably, all six lie on an ellipse:

19*x*^{2} + 36*yx* + 41*y*^{2} – 333*x* – 531*y* + 1638 = 0

Even more remarkably, if we take the digits two at a time:

(14, 28), (42, 85), (28, 57), (85, 71), (57, 14), (71, 42),

these points also lie on an ellipse:

-165104*x*^{2} + 160804*yx* + 8385498*x* – 41651*y*^{2} – 3836349*y* – 7999600 = 0

That’s from David Wells, *The Penguin Dictionary of Curious and Interesting Numbers* (1986). Victor Hugo wrote, “Mankind is not a circle with a single center but an ellipse with two focal points, of which facts are one and ideas the other.”

# A Guest Appearance

The Fibonacci numbers are the ones in this sequence:

1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, …

Each number is the sum of the two that precede it. But now, interestingly:

“And so on!” writes James Tanton in *Mathematics Galore!* (2012). “The first relation, for instance, states that a line of slope 1/2 stacked with a line of slope 1/3 gives a line of slope 1. (Can you prove the relations?)”

(Ko Hayashi, “Fibonacci Numbers and the Arctangent Function,” *Mathematics Magazine* 76:3 [June 2003], 215.)

# Reverie

“Stopping by Euclid’s Proof of the Infinitude of Primes,” by Presbyterian College mathematician Brian D. Beasley, “with apologies to Robert Frost”:

Whose proof this is I think I know.

I can’t improve upon it, though;

You will not see me trying here

To offer up a better show.

His demonstration is quite clear:

For contradiction, take the mere

*n* primes (no more), then multiply;

Add one to that … the end is near.

In vain one seeks a prime to try

To split this number — thus, a lie!

The first assumption was a leap;

Instead, the primes will reach the sky.

This proof is lovely, sharp, and deep,

But I have promises to keep,

And tests to grade before I sleep,

And tests to grade before I sleep.

(From *Mathematics Magazine* 78:2 [April 2005], 171.)

# Notes and Measures

Howard Shapiro chose an unusual way to present his paper “Fluorescent Dyes for Differential Counts by Flow Cytometry” at the 1977 meeting of the Histochemical Society — he sang it:

Blood cells are classified by cell and nuclear shape and size

And texture, and affinity for different types of dyes,

And almost all of these parameters can quickly be

Precisely measured by techniques of flow cytometry.

It’s hard to fix a cell suspension rapidly and stain

With several fluorochromes, and this procedure, while it plain-

Ly furnishes the data which one needs to classify,

May fade away, and newer, simpler, methods never dye. …

The full paper, 76 verses with figures and sheet music, is here.