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 order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?
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?
Using four sevens (7) and a one (1) create the number 100. Except for the five numerals, you can use the usual mathematical operations (+, -, x, :), root and brackets ()