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.
John needs to purchase 100 chocolates from three different shops and he has exactly 100 rupees to do that which he must spend entirely. He must buy at least 1 Chocolate from each shop.
The first shop is selling each chocolate at 5 paise, the second is selling at 1 rupee and the third is selling at 5 rupees.
In the picture that is attached with this question, you can find a square which comprises of four little squares inside it. Consider this square to be made with matchsticks. You have to remove two matchsticks such that only two squares remain instead of five.How will you do it ?
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.
A boy was driving a car, a girl took a lift from her. She asked his name. The boy said - my name is hidden in my car’s number, find it if you can. After this, she got down Car number was [ WV733N ] Can you guess the name now?