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.
A chess tournament is taking place on knock-out terms (the one who loses the match is out of the game).
(a) If 10 matches are played in total, how many players participated?
(b) If 20 players took part in the tournament, how many matches were played?
In the picture that is attached with this question, you can find a square which comprises of four little squares inside it. Consider this square to be made with matchsticks. You have to remove two matchsticks such that only two squares remain instead of five.How will you do it ?
I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:
First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.
Suppose that you are trapped on the surface of a frozen lake. The surface is so smooth and ideal that there is no friction at all. You cant make any grip on the ice and no wind is blowing to help you out. You have just a mobile phone with you which has got no reception disabling you to call for help.
How will you plan your escape before you freeze to death on the frozen lake?
See the given image carefully. What you have to do is move the blue checkers in the position of the black checkers and vice versa. You are only allowed to move the checker to an adjacent empty space. Do it in the least possible moves.