John the milkman has two 10-gallon cans full of milk. Two customers have a 5- and a 4-quart measure and want 2 quarts put into each measure. How can he accomplish this?
“It is a juggling trick pure and simple, devoid of trick or device, but it calls for much cleverness to get two exact quarts of milk into those measures employing no receptacles of any kind except the two measures and the two full cans.”
This fills can A and leaves 2 quarts in the 4-quart pail. “Thus the milkman has supplied each of his customers with exactly two quarts of milk and solved his perplexing problem.”
These drawings depict an object as seen from above and from the front. What does it look like when viewed from the side? The object has no curved surfaces, and all hidden edges in such drawings are represented by dotted lines.
A puzzle from the 1998 Moscow Mathematical Olympiad, via Peter Winkler’s excellent Mathematical Puzzles, 2021:
An anthropologist is surrounded by a circle of natives. Each native either always lies or always tells the truth. The anthropologist asks each native whether the native to his right is a liar or a truth teller. From their answers, she’s able to deduce the fraction of the circle who are liars. What is the fraction?
The key is to notice that if all the liars were changed to truth-tellers and vice versa, none of the answers would change. So if the fraction x can be determined, it must have the property that x = 1 – x, and x must be 1/2.
A problem from the Leningrad Mathematical Olympiad: You have a set of 101 coins, and you know that it contains one counterfeit coin X. The 100 genuine coins all have the same weight, which is different from that of X. Using only two weighings in an equal-arm balance, how can you determine whether X is heavier or lighter than the genuine coins?
Divide the coins arbitrarily into piles of 30, 30, and 41 coins, calling these respectively A, B, and C. Now weigh A against B. If these balance, then X must be in C; combine A and B and weigh 41 of these coins against the 41 coins in C and you’ll find out whether X is heavy or light.
If A and B don’t balance, then one of those groups contains the bad coin. For definiteness, suppose that A goes down in the weighing. That means either that A contains the bad coin and it’s heavy or that B contains the bad coin and it’s light. So determining where X is will also tell us its relative weight.
Divide A in half and weigh these halves against each other. If they balance then the coins are all good and X must be in B. If they don’t balance then X is in A.
(Obviously the same plan will work with certain pile sizes other than 30, 30, and 41, but that arrangement will do the job.)
In Lloyd C. Douglas’ 1929 novel Magnificent Obsession, a doctor dies of a heart attack, leaving behind a journal written in cipher. The first page is shown here. Can you read it?
A puzzle from the excellent Riddler feature at FiveThirtyEight, via Oliver Roeder’s 2018 collection The Riddler:
Your eccentric friend Nigel flies from Heathrow to an airport somewhere in the 48 contiguous states, then hires a car and drives around the country, touching the Atlantic and Pacific Oceans and the Gulf of Mexico, then returns to the airport at which he started and flies home. If he crossed the Ohio River once, the Missouri River twice, the Mississippi River three times, and the Continental Divide four times, then there’s one state that we can say for certain that he visited on his trip. What is it?
Minnesota. In order to cross a river an odd number of times and still return to the original airport, Nigel must “go around” the river somehow. That’s not hard with the Ohio, but the Mississippi is enormous and practically divides the country. So in order to cross it three times and return to his airport, at some point he’d have had to go around the source at Lake Itasca, Minnesota.
A puzzle from James F. Fixx’s More Games for the Superintelligent, 1976:
A man who likes trains walks occasionally to a nearby railroad track and waits for one to go by. Afterward he notes whether he saw a passenger train or a freight. After several years his notes show that 90 percent of the trains he’s seen have been passenger trains. One day he meets an official of the railroad and is surprised to learn that the passenger and freight trains on this line are precisely equal in number. If the man timed his trips to the track at random, why did he see such a disproportionate number of passenger trains?
All the trains run hourly, but the freight trains follow six minutes after the passenger trains. So if the man arrives at the track at random, his odds of arriving after a freight train and before a passenger train are 9 to 1; for 54 out of every 60 minutes, a passenger train will be the next to pass.
A brainteaser from the Soviet science magazine Kvant, via Quantum, January/February 1991:
Bobby found the sum of three consecutive integers, then of the next three consecutive integers, then multiplied these two sums together. Could the product have been 111,111,111?
No. One of the two groups must contain one even number and two odd ones. The sum of these three numbers must be even, so the product of the two sums must be even as well.
Robert Bilinski proposed this problem in the April 2006 issue of Crux Mathematicorum. On square ABCD, two equilateral triangles are constructed, ABE internally and BCF externally, as shown. Prove that D, E, and F are collinear.