Two fathers and two sons decided to go to a shop and buy some sweets upon reaching. Each of them bought 1 kg of sweet. All of them returned home after some time and found out that they had 3kg of sweets with them.
They did not eat the sweets in the way, nor threw or lose anything. Then, how can this be possible?
You have a thousand Re. 1 coins with you. You have ten bags with you and you can put any number of coins in each of the bags. The condition is that if someone asks you for any amount between 1 and 1000, you must be able to give that amount by just giving the bag (you are not allowed to open the bag and give coins).
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.
One day, all the courtiers from Akbar's court were gathered in the assembly hall when one of them told the Emperor that all his valuables had been stolen by a thief the previous night.
This shocked the Emperor to his core as the place where that courter stayed was the most secured in the kingdom. The Emperor thought that it is not at all possible for an outsider to enter into the courtier's house and steal the valuables. Only another courtier could commit this crime. He quickly called Birbal to identify the thief.
Birbal thought for a while and successfully solved the mystery by identifying the thief in just one statement.
What did Birbal say?
