A father told his three sons he would die soon and he needed to decide which one of them to give his property to. He said, “Go to the market and buy something large enough to fill my bedroom, but small enough to fit in your pocket. From this, I will decide which of you is the wisest and worthy enough to inherit my land.†They all went to the market, and each came back with a different item. The father told his sons to come into his bedroom one at a time and try to fill up his bedroom with their items. The first son came in and put some pieces of cloth he bought and laid them across the room, but it barely covered the floor. The second son came in and laid some hay on the floor, but there was only enough to cover half the floor. The third son came in and showed his father what he bought. He wound up getting the property. What did the third son show his father?
The host of a game show, offers the guest a choice of three doors. Behind one is a expensive car, but behind the other two are goats.
After you have chosen one door, he reveals one of the other two doors behind which is a goat (he wouldn't reveal a car).
Now he gives you the chance to switch to the other unrevealed door or stay at your initial choice. You will then get what is behind that door.
You cannot hear the goats from behind the doors, or in any way know which door has the prize.
If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.
I can sizzle like bacon,
I am made with an egg,
I have plenty of backbone, but lack a good leg,
I peel layers like onions, but still remain whole,
I can be long, like a flagpole, yet fit in a hole.
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki
