J. Bryan III used to challenge his friends to think of an English word that contains either of the following strings of letters:
ILIL
ILIW
“I’ve never played the game with anyone who could solve either of these combinations.” Can you?
J. Bryan III used to challenge his friends to think of an English word that contains either of the following strings of letters:
ILIL
ILIW
“I’ve never played the game with anyone who could solve either of these combinations.” Can you?
“Improprieties in pronunciation” among the people of New England in 1808, collected by Caleb Bingham and published in The Child’s Companion:
afraid: afeard apron: apun audacious: outdacious bonfire: burnfire brittle: brickle cards: cairds caught: cotch coin: quine cucumber: cowcumber dictionary: dixonary drain: dreen earth: airth fanciful: fancical five pence: fippence gown: gound grasshopper: hoppergrass jaundice: janders musician: musicianer poplar: popple quart: quairt quotient: coshun sassafras: saxafax turtle: turcle tutor: tutorer umbrella: amberrillar Vermont: Vermount walnut: warnut watermelon: watermillion
“It is not to be supposed that they are all in common use in every part of New England. Some of them are local. In general, however, they are used more or less in all the New England States.”
How can we make sense of this passage, composed by Willard R. Espy?
The Optic Reed has a Haste Harm. It Hose, one assumes, not to be Lever; it neither Heats the Ripple, nor Hides the Razed sinner for his Rude Rime; it is not Old. Then Leave to it; ere thy grave Loses, thou mayst find here the Hart to the Rest thou Ravest to Limb.
A doubly true equation by Basile Morin.
A circle is divided into six sectors, into which are written (say, counterclockwise) these numbers:
1, 0, 1, 0, 0, 0
You can increase any two neighboring numbers by 1. By doing this repeatedly, is there a way to make all six numbers equal?
A problem by Nikolai Rozov:
“If the brainteaser you solved before you solved this one was harder than the brainteaser you solved after you solved the brainteaser that you solved before you solved this one, was the brainteaser you solved before you solved this one harder than this one?”
This remarkable phenomenon was discovered by Cambridge mathematician James Grime. Number five six-sided dice as follows:
A: 2, 2, 2, 7, 7, 7
B: 1, 1, 6, 6, 6, 6
C: 0, 5, 5, 5, 5, 5
D: 4, 4, 4, 4, 4, 9
E: 3, 3, 3, 3, 8, 8
Now, on average:
A beats B beats C beats D beats E beats A
and
A beats C beats E beats B beats D beats A.
Interestingly, though, if each die is rolled twice rather than once, then the first of the two chains above remains unchanged except that D now beats C — and the second chain is reversed:
A beats D beats B beats E beats C beats A.
As a result, if each of two opponents chooses one of the five dice, a third opponent can always find a remaining die that beats them both (so long as he’s allowed to choose whether the dice will be rolled once or twice).
(Ward Heilman and Nicholas Pasciuto, “What Nontransitive Dice Exist Among Us?,” Math Horizons 24:4 [April 2017], 14-17.)
Excerpts from letters received by the British pensions office, quoted in George Lyttelton’s Commonplace Book, 2002:
By Wikimedia user Efbrazil. Fill in four squares to make a continuous dark path connecting the stars. No diagonal moves are allowed.