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.
In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?
In a school, 280 students studied chemistry, 254 students studied physics and 280 students studied biology.
97 students studied chemistry as well as physics, 138 students studied physics as well as biology and 152 students studied chemistry as well as biology.
You have two strings whose only known property is that when you light one end of either string it takes exactly one hour to burn. The rate at which the strings will burn is completely random and each string is different. How do you measure 45 minutes?