At a party, there are five people and a whole round cake lying at the centre of the table. Only four people will make a cut and take their piece and the last one will get the remaining piece on the table. How can they make sure that everyone gets a 1/5th of the piece?
Today is John's birthday.
A year ago, John had five candles and he lit all the candles except the one at the last.
Now he is going to light all the candles.
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?
You stand in front of two doors. A guard stands next to each door. You know the following things: one path leads to paradise, the other leads to death. You cannot distinguish between the two doors. You also know that one of the two guards always tells the truth and the other always lies. You have permission to ask one guard one question to discover which door leads to paradise. What one question would you ask to guarantee you enter the door to paradise?
In a box, there is a jumble of 7 red balls, 6 blue balls, 5 green balls, and 4 yellow balls. What is the minimum number of balls, will you have to pick up so that you have at least 4 balls of the same colour?
A worker is to perform work for you for seven straight days. In return for his work, you will pay him 1/7th of a bar of gold per day. The worker requires a daily payment of 1/7th of the bar of gold. What and where are the fewest number of cuts to the bar of gold that will allow you to pay him 1/7th each day?
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.
