Imagine a box with two cogwheels, one big with 24 teeth and one small with 8 teeth. The big one is firmly attached to the center of the box which means it does not turn or move while the small one rotates around the big one.
How many times do you think that the smaller wheel will turn compared to the box when it turns once around the big one?
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.
You visit a home for specially-abled children on the occasion of Christmas where you meet with 50 children. You have a box of chocolates containing 50 chocolates exactly.
What if you were asked to one chocolate to each child in a manner that one chocolate still remains in the box? Is it possible?
You are a cab driver who pools passengers. You pick 3 people from a destination and drop 1 after an hour. 2 people climb aboard at the same time and you drop 3 at the next destination. After some time, you pick 2 passengers only to drop 1 after a short distance where 3 more passengers climb up the cab. You leave the rest of the passengers one by one to their destination and then come back home.
You stand in front of two doors. A guard stands next to each door. You know the following things: one path leads to paradise, the other leads to death. You cannot distinguish between the two doors. You also know that one of the two guards always tells the truth and the other always lies. You have permission to ask one guard one question to discover which door leads to paradise. What one question would you ask to guarantee you enter the door to paradise?
A man looks at a painting in a museum and says, “Brothers and sisters I have none, but that man’s father is my father’s son.†Who is in the painting?
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