You are a thief and you are being punished for your crime. People have tied your head down on a tree with a rope that has been anchored in the ground. A candle is burning below the rope which is slowly burning it away. Just below your head, a Lion has been left loose and is waiting for you to drop down on the ground so he can have you as his lunch.
You have to survive the scenario. How will you do it?
Flat 1 is named the first flat.
Flat 2 is named the second flat.
Flat 3 is named the third flat. And So On.....
A visitor decides to walk through all the flats, and he finds all the flats except flat 62.
Anmol later founds that the locals of the town have given it another name.
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.
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
