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: Hard, Harder, and Hardest are brothers. By age from youngest to oldest, it goes Hard, Harder, Hardest. Hard is half the age of Hardest who is 20 which means hard is 10. Harder has a two-year difference between the number of years older he is than Hard and the number of years younger he is than Hardest. Harder is closer to the age of Hard than Hardest. How old is Harder?