15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.
How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?
A woman lives in a skyscraper thirty-six floors high and is served by several elevators which stop at each floor going up and down. Each morning she leaves her apartment and goes to one of the elevators. Whichever one she takes is three times more likely to be going up than down. Why?
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?
A man escapes from jail using help from his girlfriend. The investigators suspect four girls of being the man's girlfriend.
Out of those four girls, one is his girlfriend who is lying. Two of the girls are completely innocent and are speaking the truth. One of the girls is the man's sister who is helping the girlfriend lie. Following are the statements from all four of them:
Ariana: "Myrna is his girlfriend."
Jane: "Angelina is lying."
Angelina: "Ariana is lying."
Myrna: "Jane is not his sister."
Can you find out who is the man's sister among them?
Pronounced as 1 letter, And written with 3, 2 letters there are, and 2 only in me. I’m double, I’m single, I’m black blue and grey, I’m read from both ends, and the same either way. What am I?
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki