Two friends were stuck in a cottage. They had nothing to do and thus they started playing cards. Suddenly the power went off and Friend 1 inverted the position of 15 cards in the normal deck of 52 cards and shuffled it. Now he asked Friend 2 to divide the cards into two piles (need not be equal) with equal number of cards facing up. The room was quite dark and Friend 2 could not see the cards. He thinks for a while and then divides the cards in two piles.

On checking, the count of cards facing up is same in both the piles. How could Friend 2 have done it ?

Two guards were on duty outside a barracks. One faced up the road to watch for anyone approaching from the North. The other looked down the road to see if anyone approached from the South. Suddenly one of them said to the other, "Why are you smiling?"

How did he know his companion was smiling?

What word is pronounced the same if you take away four of its five letters?

A woman who works in a sweet shop has a measurement of 32-26-36, is 5"4" tall, and wears size "6" shoes. What do you think she weighs?

Three doctors said that Bill was their brother. Bill says he has no brothers. How many brothers does Bill actually have?

There is an ancient kingdom where every married woman keeps information regarding the fidelity of other men. However, what they don't know is the fidelity of their own husbands. Also, there is an ancient belief that they don't tell each other about the fidelity of their husbands.

On a certain day, the queen of the kingdom declares that she has identified at least one unfaithful man in the kingdom. She allows the wives to identify and gives them authority to kill their husbands if they are unfaithful at midnight.

How will the wives manage it?

A famous swimmer can swim downstream in a lake in exactly 40 minutes with the lake current.
He can swim upstream in that lake in exactly 60 minutes against the lake current.
The length of the lake is 2 km.

How long he can cover the distance of one side at a still lake with no current?

What is the end of everything?

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?

What work can one never finish?