There is a jar in which there are two types of candies.
20 blueberries and 16 strawberries. You perform the following steps:
1) You take out two candies.
2) If the two candies are of the same flavour, you add a blueberry one otherwise, you add the strawberry one.
You repeat these two steps till there is just one candy remaining in the jar. Which flavoured candy will be left?
John has eleven friends. He has a bowl containing eleven apples. Now He wants to divide the eleven apples among his friends, in such a way that an apple should remain in his bowl.
How can He do it?
There was a blind beggar living on the footpath of a street. Suddenly one day, the beggar's brother died. What was the relation of the blind beggar with the person who died?
There was a greenhouse.
Inside the greenhouse, there is a white house.
Inside the white house, there is a red house.
Inside the red house, there are lots of babies.
You are playing a game with your friend Jack. There are digits from 1 to 9. You both will take turn erasing one digit and adding it to your score. The first one to score 15 points will win the game.
There are people and strange monkeys on this island, and you can not tell who is who (Edit: until you understand what they said - see below). They speak either only the truth or only lies.
Who are the following two guys?
A: B is a lying monkey. I am human.
B: A is telling the truth.
A detective visits his friend John just to discover that John's neighbour Dr Jacob was murdered. Dr Jacob, who is a mathematician wrote the murderer's name in a code word "Hcqtfz". There were five suspects
1. Ajit
2. Pankaj
3. Ganpat
4. Deenu
5. Hariya
The Detective was instantly able to find the murderer.
Can you?
Find out a multi-digit number that if multiplied by the number 9 or any of its multiplications products (i.e. 18, 27, 36, 45,..) will result in the multiplication factor repeated (n) number of times.
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