One night, a man received a call from the Police. The Police told the man that his wife was murdered, and that he should get to the crime scene as soon as possible. The man immediately hung up the phone and drove his car for 20 minutes. As soon as he got to the crime scene, the Police arrested him, and he got convicted for murder.
How did the Police know that the man committed the crime?
SOLUTION
The police did not tell the man where the crime scene was.
We see that F, G, H, I, J < 2. If H = 1, I = 1, or J = 1, then the number contains at least 7 identical digits, clearly 0s. We find A > 6 and E = F = G = 0. It is easy to see that this does not lead to solutions, and then H = I = J = 0.
If G = 1, we get E = F = 0. There is a 6 in the number, so it must be A. We get 6BCD001000, and easily find the solution 6210001000.
If G = 0, F can be 0 or 1. If F = 1, then there must be a 5 in the number, so it must be A. We get 5BCDE10000. We don’t find any solutions.
If F = 0, then the number has at least five 0s, and therefore A > 4. However, since F = G = H = I = J = 0, the number does not have any digits larger than 4, and we get a contradiction.
There are 5 points in a square 1×1. Show that 2 of the points are within distance 0.75.
SOLUTION
Split the unit square into 4 small squares with side lengths 0.5. At least one of these squares will contain 2 of the points. Since the diagonals of the small squares have lengths less than 0.75, these 2 points must be within such distance.
There are 5 fish in a pond. What is the probability that you can split the pond into 2 halves using a diameter, so that all fish end up in one half?
SOLUTION
Let us generalize the problem to N fish in a pond. We can assume that all fish are on the boundary of the pond, which is a circle, and we need to find the probability that all of them are contained within a semi-circle.
For every fish Fᵢ, consider the semi-circle Cᵢ whose left end-point is at Fᵢ. The probability that all fish belong to Cᵢ is equal to 1/2ᴺ⁻¹. Since it is impossible to have 2 fish Fᵢ and Fⱼ, such that the semi-sircles Cᵢ and Cⱼ contain all fish, we see that the probability that all fish belong to Cᵢ for some i is equal to N/2ᴺ⁻¹.
The following 2 puzzles rely on misleading phrasing of the questions. Read them aloud to your friends and let them ponder upon them.
What has 4 letters, sometimes 9, and never 5
One night a king and a queen stayed in a hotel. On the next day, three people checked out. Who was the third person?
There are 30 cows and 28 chickens. How many didn’t?
Pronounce the following words: T-W-A, T-W-E, T-W-I, T-W-O
As I was walking across the London Bridge, I met a man. He tipped his hat, and drew his cane. In this riddle, I said his name. What is it?
SOLUTION
The first puzzle is not a question. It is a statement, saying that the word “what” has 4 letters, the word “sometimes” has 9 letters, and the word “never” has 5 letters. There is nothing to solve, so the puzzle is figuring that out!
The second puzzle reads as “One knight, a king, and a queen stayed in a hotel.” Thus, the third person was the knight.
The third puzzle reads as “There are 30 cows and 20 ate chickens. How many didn’t?” Thus, the answer is that 10 cows didn’t eat chickens.
The fourth question often confuses people and they pronounce TWO as [twou] instead of [tuː].
The fifth riddle actually says: “He tipped his hat, ‘Andrew Hiscane'”. Thus, the name of the man is Andrew Hiscane.
The evil witch has left Rapunzel and the prince in the center of a completely dark, large, square prison room. The room is guarded by four silent monsters in each of its corners. Rapunzel and the prince need to reach the only escape door located in the center of one of the walls, without getting near the foul beasts. How can they do this, considering they can not see anything and do not know in which direction to go?
SOLUTION
The prince must stay in the center of the room and hold Rapunzel’s hair, gradually releasing it. Then, Rapunzel must walk in circles around the prince, until she gets to the walls and finds the escape door.
Take a square (or circle) coaster. Then, cut a hole in a piece of paper with the shape of a square, so that the side of that square is half of the side (or the diameter) of the coaster. Now, your goal is to push the coaster through the hole without tearing the paper (you can fold it).
A hungry lion runs inside a circus arena which is a circle of radius 10 meters. Running in broken lines (i.e. along a piecewise linear trajectory), the lion covers 30 kilometers. Prove that the sum of all turning angles is at least 2998 radians.
SOLUTION
Imagine the lion is static, facing North, and instead, the center of the arena moves around. Then, each time the lion runs X meters in some direction, this translates into the center moving X meters South. Each time the lion makes a turn of Y radians, this translates into the center moving along an arc of Y radians.
Thus, the problem translates to a point inside the arena alternating between traveling straight South and then moving along arcs around the center of the arena. Since the total distance traveled straight South by the point is 30KM and the distance between the starting and the ending points is at most 20M, the total distance traveled North must be at least 30KM – 20M = 29980M. Therefore, the total length of the arcs traversed by the point is at least 29980M, and since the radius of each arc is at most 10M, the total angle of the arcs must be at least 2998 radians. The sum of all turning angles of the lion is the same, so this concludes the proof.