Thirty friends were on a hiking trip when they decided to enjoy the bonfire. They assembled for it and agreed to play a game. For that, they divided themselves into five teams with seven members each, forming five rows.
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.
As shown in the image, the nine Dogs are square fenced. By constructing just two square fences can you make sure that two Dogs cannot meet each other without crossing the fence?
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
