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.
You have an empty wine bottle with a cork that has been secured at the top in a normal way. There is a metal ring inside the bottle that is suspended by a string.
How can you make the metal ring drop to the bottom if you are not allowed to touch anything - not the bottle, not the cork, not the thread and not the ring?
You are provided with a grid (as shown in the picture). Can you fill the squares with numbers 1-8 in a manner that none of the two consecutive numbers are placed next to each other in any direction (vertically, horizontally or diagonally?)
A boy purchased a book from a bookkeeper and gave him $100.
The cost of the book is $50 but the bookkeeper has no change, so he gets the change from the next shop and returns the boy his $50.
After some time the next shopkeeper came with the $100 note and told the bookkeeper that the note was a fraud, so he took the money back.
15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.
How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?