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.
A convention is held where all the big logicians are summoned. The master places a band on everyone's forehead. Now all of them can see others bands but can't see his own. Then they are told that there are different colours of bands. All the logicians sit in circle and they are further explained that a bell will ring at regular intervals. The moment when a logician knew the colour of band on his forehead, he will leave at the next bell. If anyone leaves at the wrong bell, he will be disqualified.
The master assures the logicians that the puzzle will not be impossible for anyone of them. How will the logicians manage ?
An equation has been laid down using a few matchsticks. However, as you can see, the equation is not correct. Can you correct the equation if you are allowed to add or remove 5 matchsticks?
A man died, leaving $10,000,000 for his widow, 5 sons and 4 daughters. Each daughter received an equal amount, each son received twice as much as a daughter, and the widow received three times as much as a son.
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