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?
There are four 3-link chains. All you have to do is join them into a big 12-link chain. For joining two closed links, one of the links must be cut and placed onto the other link for closing.
How many minimum links will you have to cut to make the big chain?
You walk into a room where there are three primates held in their respective cages:
1) A lion who is eating the flesh of a goat.
2) An orangutan who is playing with blocks.
3) A donkey who is sitting idle.
A four-digit number (not beginning with 0) can be represented by ABCD. There is one number such that ABCD=A^B*C^D, where A^B means A raised to the B power. Can you find it?
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.
