Only one color, but not one size,
Stuck at the bottom, yet easily flies.
Present in sun, but not in rain,
Doing no harm, and feeling no pain.
What is it?
A thief enters a store and threatens the clerk, forcing her to open the safe. The clerk says, “The code for the safe is different every day, and if you hurt me you’ll never get the code.†But the thief manages to guess the code on his own. How did he do it?
A deaf and mute man goes to the train station. Tickets for the train are 50 cents each. The man goes to the ticket booth and hands the man inside just a dollar. The man in the booth hands him two tickets.
How did the man in the booth know to give him two tickets without even looking at him?
A devotee visits 9 temples when he visits India. All these nine temples have one thing in common - there are 100 steps in every temple. The devotee puts the Re.1 coin after climbing up every step. He does the same while climbing down every step. At each temple, the devotee offers half of his money from his pocket to god. In this way, his pocket becomes empty after he visits the 9th temple.
Can you calculate the total amount he had initially?
James ordered a fishing rod, priced at $3.56. Unfortunately, James is an Eskimo who lives in a very remote part of Greenland and the import rules forbid any package longer than 4 feet to be imported. The fishing rod was 4 feet and 1 inch, just a little too long, so how can the fishing rod be mailed to James without breaking the rules? Ideally James would like the fishing rod to arrive in one piece!
A California farmer owns a beautiful pear tree. He supplies the fruit to a nearby grocery store. The store owner calls the farmer to see how much fruit is available for him to buy. The farmer knows the main trunk has 24 branches. Each branch has exactly 12 boughs and each bough has exactly 6 twigs. Since each twig bears one piece of fruit, how many plums will the farmer be able to deliver?
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