10 people came into a hotel with 9 rooms and each guest wanted his own room. The bellboy solved this problem.
He asked the tenth guest to wait for a little with the first guest in room number 1. So in the first room, there were two people. The bellboy took the third guest to room number 2, the fourth to number 3, ..., and the ninth guest to room number 8. Then he returned to room number 1 and took the tenth guest to room number 9, still vacant.
How can everybody have his own room?
Can you find a seven digit number which describes itself. The first digit is the number of zeros in the number. The second digit is the number of ones in the number, etc. For example, in the number 21200, there are 2 zeros, 1 one, 2 twos, 0 threes and 0 fours.
A king sentenced a man to the death sentence for some crime he had committed. Known for his kindness, the king told the culprit that he had a choice to die in a way he decides.
The culprit was clever and said something that saved him from death. What method do you think he must have chosen for his death?
When a clock is observed, the hour hand is at a minute mark and the minutes hand is six minutes ahead of it.
When the clock is observed again after some time, the hour hand is precisely on a different minute mark and the minute hand is seven minutes ahead of it.
Can you calculate how much time has elapsed between the two observations?
Here is what you have to do. You have to throw a ball as hard as you can but it must return back to you even if it does not bounce at anything. Also, you have nothing attached to the ball. There is no one on the other end to catch that ball and throw it back at you.
John Went to the nearby store in a Mall to buy something for her home. Below is the conversation between the two:
John: How much for the one?
Shopkeeper: It is $2
John: How much for the Eleven?
Shopkeeper: It is $4
John: How much for the Hundred?
Shopkeeper: It is $6.
Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?
