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.
It is an eleven letter word.
The first, second, third and fourth letters form a banquet's name.
The fifth, sixth and seventh letters form a car's name.
The eighth, ninth, tenth and eleventh letters form a mode of transport.
You are driving down the road in your car on a wild, stormy night, when you pass by a bus stop and you see three people waiting for the bus
An old lady looks as if she is about to die.
An old friend who once saved your life.
The perfect partner you have been dreaming about.
Knowing that there can only be one passenger in your car, whom would you choose?
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?
Can you find a seven digit number which describes itself. The first digit is the number of zeros in the number. The second digit is the number of ones in the number, etc. For example, in the number 21200, there are 2 zeros, 1 one, 2 twos, 0 threes and 0 fours.