Question: I'm teary-eyed but never cry.
Silver-tongued, but never lie.
Double-winged, but never fly.
Air-cooled, but never dry.
What am I?
Answer: Mercury. The element looks shiny, silver, and is wet. The god Mercury has two wings but only uses them to run.
Question: A man is found dead in a phone booth in a pool of blood. The glass on either end of the phone booth is broken and the phone is hanging. Just outside of the phone booth is a bucket and a stick.
Answer: The man was a fisherman and was telling somebody on the phone about the large fish he caught. When he used his hands to gesture how big the fish was he hit the glass breaking it and cutting himself.
Question: Ants on a stick may only move left or right. If they bump into each other they bounce off of each other and immediately move in the opposite direction maintaining speed the entire time. The only time they change speed is when they fall off of the edge of the stick.
If 25 ants are randomly put on a 1 meter long stick moving 1 meter per second, what is the longest amount of time it could take for them to all fall off?
Answer: The answer is 1 second.
Imagine that each ant is holding a flag and that when an ant bumps into another ant it gives its flag to the other ant. In this way, every ant always has a flag and a flag would never change direction. So each flag would head towards the edge at a rate of 1 meter per second and since the stick is 1 meter long, it would only take 1 second at most for each flag to fall off, and in turn, each ant.
Question: A very famous chemist was found murdered in his kitchen today. The police have narrowed it down to six suspects. They know it was a two man job. Their names: Felice, Maxwell, Archibald, Nicolas, Jordan, and Xavier.
A note was also found with the body: '26-3-58/28-27-57-16'.
Who are the killers?
Answer: Felice and Nicholas are the murderers. The numbers correspond to atomic numbers on the periodic table of elements: 'Fe-Li-Ce/Ni-Co-La-S'.
Question: You have a bag with 'N' strings in it. You randomly grab two ends and tie them together until there are no more loose ends.
In the end, what is the expected number of loops (strings tied to their own end)?
Answer: 1 + 1/3 + 1/5 ... + 1/(2N-1).
Each time you tie two together the number of string ends available decreases by 2. The chance of grabbing a string and its end is 1/(2N-1).