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.
Here is what you have to do. You have to throw a ball as hard as you can but it must return back to you even if it does not bounce at anything. Also, you have nothing attached to the ball. There is no one on the other end to catch that ball and throw it back at you.
In a chess board, the queen piece can move horizontally, vertically and diagonally freely. The picture represents the same.Can you place 8 queens on the board in a manner that none of the queens can attack each other?
You have $100 with you and you have to buy 100 balls with it. 100 is the exact figure and you can't go below or above the numbers and you have to use the entire $100. If there is no kind of tax applied how many of each of the following balls will you be able to buy:
Green Balls costing $6
Yellow Balls costing $3
Black Balls costing $0.10
Now, how many of each must you buy to fulfil the condition given?
