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).
Question: Two men were on a ship. They were both facing opposite directions, one facing east and the other facing west. But, they were both seeing each other. *WITHOUT MIRRORS* How is this possible?
Answer: They were both facing each other