Right and Wrong

Can objects have preferences? The rattleback is a top that seems to prefer spinning in a certain direction — when spun clockwise, this one arrests its motion, shakes itself peevishly, and then sweeps grandly counterclockwise as if forgiving an insult.

There’s no trick here — the reversal arises due to a coupling of instabilities in the top’s other axes of rotation — but prehistoric peoples have attributed it to magic.

See Right Side Up.

High Hopes

A worm crawls along an elastic band that’s 1 meter long. It starts at one end and covers 1 centimeter per minute. Unfortunately, at the end of each minute the band is instantly and uniformly stretched by an additional meter. Heroically, the worm keeps its grip and continues crawling. Will it ever reach the far end?

Click for Answer

Heads and Tails

Let’s play a coin-flipping game. At stake is half the money in my pocket. If the coin comes up heads, you pay me that amount; if it comes up tails, I pay you.

Initially this looks like a bad deal for me. If the coin is fair, then on average we should expect equal numbers of heads and tails, and I’ll lose money steadily. Suppose I start with $100. If we flip heads and then tails, my bankroll will rise to $150 but then drop to $75. If we flip tails and then heads, then it will drop to $50 and then rise to $75. Either way, I’ve lost a quarter of my money after the first two flips.

Strangely, though, the game is fair: In the long run my winnings will exactly offset my losses. How can this be?

Click for Answer

Rules of Thumb

http://commons.wikimedia.org/wiki/File:A_scientist.jpg

“If an elderly but distinguished scientist says that something is possible he is almost certainly right, but if he says that it is impossible he is very probably wrong.” — Arthur C. Clarke

“When, however, the lay public rallies around an idea that is denounced by distinguished but elderly scientists and supports that idea with great fervor and emotion — the distinguished but elderly scientists are then, after all, probably right.” — Isaac Asimov

Midair

A “curious puzzle” from Raymond Smullyan:

Imagine a plane table of infinite extent. Attached perpendicularly to the table is a rod of finite length, and above that, attached by a hinge, is a second vertical rod, this one infinitely long.

Operate the hinge. What happens? The infinite rod descends freely through the first 90 degrees, until it’s parallel to the tabletop. But it can’t go beyond this, because then at some point the solid rod would intersect the solid table.

Thus it’s impossible to “rest” an infinite rod on an infinite plane. “And so, you have the curious phenomenon of the hinged rod being supported at only one end!”

Teamwork

LOGIC, n. The art of thinking and reasoning in strict accordance with the limitations and incapacities of the human misunderstanding. The basic of logic is the syllogism, consisting of a major and a minor premise and a conclusion–thus:

Major Premise: Sixty men can do a piece of work sixty times as quickly as one man.

Minor Premise: One man can dig a posthole in sixty seconds; therefore–

Conclusion: Sixty men can dig a posthole in one second.

This may be called the syllogism arithmetical, in which, by combining logic and mathematics, we obtain a double certainty and are twice blessed.

— Ambrose Bierce, The Devil’s Dictionary, 1911

Gray Area

http://commons.wikimedia.org/wiki/File:Karel_Dujardin_-_Italian_Landscape_with_Herdsman_and_a_Piebald_Horse_WGA.jpg

A legal conundrum from Jonathan Swift and Alexander Pope’s Memoirs of Martinus Scriblerus (1741): Sir John Swale bequeaths to Matthew Stradling “all my black and white Horses.” Sir John has six black, six white, and six pied horses. Should Stradling get the pied ones?

On the one hand, “Whatever is Black and White, is Pyed, and whatever is Pyed is Black and White; ergo, Black and White is Pyed, and, vice versa, Pyed is Black and White.”

On the other, “A pyed Horse is not a white Horse, neither is a pyed a black Horse; how then can pyed Horses come under the Words of black and white Horses?”

Perhaps this will help — a proof that all horses are the same color, condensed from Joel E. Cohen, “On the Nature of Mathematical Proofs,” Opus, May 1961, from A Random Walk in Science:

It is obvious that one horse is the same colour. Let us assume the proposition P(k) that k horses are the same colour and use this to imply that k+1 horses are the same colour. Given the set of k+1 horses, we remove one horse; then the remaining k horses are the same colour, by hypothesis. We remove another horse and replace the first; the k horses, by hypothesis, are again the same colour. We repeat this until by exhaustion the k+1 sets of k horses have each been shown to be the same color. It follows then that since every horse is the same colour as every other horse, P(k) entails P(k+1). But since we have shown P(1) to be true, P is true for all succeeding values of k, that is, all horses are the same colour.