A convention is held where all the big logicians are summoned. The master places a band on everyone's forehead. Now all of them can see others bands but can't see his own. Then they are told that there are different colours of bands. All the logicians sit in circle and they are further explained that a bell will ring at regular intervals. The moment when a logician knew the colour of band on his forehead, he will leave at the next bell. If anyone leaves at the wrong bell, he will be disqualified.
The master assures the logicians that the puzzle will not be impossible for anyone of them. How will the logicians manage ?
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 was visiting his friend Jacob. He found out that his friend's wife had just killed a burglar in self-defense.
John asks Jacob about what happened and he told that "His wife was watching television when suddenly the bell rang. She thought that it is her husband Jacob but she found the burglar who attacked her instantly and she got so frightened that she killed the burglar immediately with the knife.
John asked the police to arrest his friend's wife. Why?