Two friends were betting. One said to the other, "The coin will be flipped twenty times and each time the coin lands on the head, I will give you $2 and each time it lands on the tale, you will give me $3." After flipping the coin twenty times not a single penny was exchanged among them.
There was a kingdom in which the king had no heir to take over his thrown. Even the queen was dead and he himself was on the verge of dying. He thought about it and then summoned all of the teenagers. He gave one seed each to all of them and asked them to grow the plant. He announced that the one with the most beautiful plant will become the king/queen of the empire after the death of the king.
After a month, all of them were called. The king looked at all of the plants but announced the girl with an empty pot as the queen of the empire. Why?
You are trapped in a room with two doors. One leads to certain death and the other leads to freedom. You don't know which is which.
There are two robots guarding the doors. They will let you choose one door but upon doing so you must go through it.
You can, however, ask one robot one question. The problem is one robot always tells the truth, the other always lies and you don't know which is which.
What is the question you ask?
A man is walking down a road with a basket of eggs. As he
is walking he meets someone who buys one-half of his eggs
plus one-half of an egg.
He walks a little further and meets another person who buys
one-half of his eggs plus one-half of an egg.
After proceeding further he meets another person who buys
one-half of his eggs plus one half an egg. At this point, he
has sold all of his eggs, and he never broke an egg.
How many eggs did the man have to start with?
In case you were starting to feel confident, this one was meant for third graders in Vietnam. The answer is 66, but we don't blame you for scratching your head about how they got there.
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
