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.
A bus driver was heading down a street in Mexico. He went right past a stop sign without stopping, he turned left where there was a "no left turn" sign, and he went the wrong way on a one-way street. Then he went on the left side of the road past a cop car. Still - he didn't break any traffic laws. Why not?
There is a box in which distinct numbered balls have been kept. You have to pick two balls randomly from the lot.
If someone is offering you a 2 to 1 odds that the numbers will be relatively prime, for example
If the balls you picked had the numbers 6 and 13, you lose $1.
If the balls you picked had the numbers 5 and 25, you win $2.
