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 need to arrange three 7 and mathematical symbols to form number 1?

Write the next letter in this sequence.
O, T, T, F, F, S, S, E, __
**Hint: It is a Number Series Puzzle

What can you serve, but never eat?

John and Jacob are playing bets. John gives $10 to Jacob and Jacob deals four cards out of a normal 52-card deck which are chosen by him completely randomly. Jacob keeps them facing down takes the first card and shows it to John. John has a choice of either keeping it or looking at the second card. When the second card is shown to him, he again has the choice of keeping or looking at the third which is followed by the third card as well; only if he does not want the third card, he will have to keep the fourth card.

If the card that John is choosing is n, Jacob will give it to him. Then the cards will be shuffled and the game will be played repeatedly. Now you might think that it all depends on chance, but John has come up with a strategy that will help him turn the favor in his odds.

Can you deduce the strategy of John?

13 decks of cards have been mixed. What is the minimum number of cards that must be taken out from the above-mixed cards to guarantee at least one 'four of a kind?

Arrange the numbers 1, 2, 3, 4, 5, 6, 7, 8 and 9 above and below the division line in a manner that the thus formed fractions equal to 1/3.

(You can use one number only once)

A convention is held where all the big logicians are summoned. The master places a band on everyone's forehead. Now all of them can see others bands but can't see his own. Then they are told that there are different colours of bands. All the logicians sit in circle and they are further explained that a bell will ring at regular intervals. The moment when a logician knew the colour of band on his forehead, he will leave at the next bell. If anyone leaves at the wrong bell, he will be disqualified.

The master assures the logicians that the puzzle will not be impossible for anyone of them. How will the logicians manage ?

John went to meet his friend Jacob, but when he was about to reach the main gate, John notices that Jacob had a mighty dog who was fastened to the tree. The chain is long enough that it allows the dog to reach the main gate.

How can the John reach the main gate?

The Puzzle: Here is a famous prize problem that Sam Loyd issued in 1882, offering $1000 as a prize for the best answer showing how to arrange the seven figures and the eight 'dots' .4.5.6.7.8.9.0. which would add up to 82