You have two strings whose only known property is that when you light one end of either string it takes exactly one hour to burn. The rate at which the strings will burn is completely random and each string is different.
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?
Pronounced as one letter,
And written with three,
Two letters there are,
And two only in me.
I am double, I am single,
I am black blue and grey,
I am read from both ends,
And the same either way.
A family is trapped in a jungle. There is a bridge which can lead them to safety. But at one time, the bridge can only allow two people to pass through. Also, all of them are afraid of the dark and thus, they can't go alone.
Father takes 1 minute to cross, the mother takes 2 minutes, the son takes 4 and the daughter takes 5 minutes. While crossing the time taken will be according to the slower one. How can they all reach the other side in the minimum possible time?
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?
Four cars come to a four-way stop, each coming from a different direction. They can’t decide who got there first, so they all go forward at the same time. All 4 cars go, but none crash into each other. How is this possible?
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