As we know that white starts the game of chess. Can you find the scenario shown in the picture below is possible when all the white pieces are at the original place while the black pawn is not as in the below picture?
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.