Solve this tricky question. You are trapped in a forest. With you, you have a gun preloaded with two bullets in it. In front of you, there is a tiger, a leopard and a jaguar.
A mile-long train is moving at sixty miles an hour when it reaches a mile-long tunnel. How long does it take the entire train to pass through the tunnel?
I ask Joseph to pick any 5 cards out of a deck with no Jokers.
He can inspect then shuffle the deck before picking any five cards. He picks out 5 cards then hands them to me (Jack can't see any of this). I look at the cards and I pick 1 card out and give it back to Joseph. I then arrange the other four cards in a special way, and give those 4 cards all face down, and in a neat pile, to Jack.
Jack looks at the 4 cards i gave him, and says out loud which card Joseph is holding (suit and number). How?
The solution uses pure logic, not sleight of hand. All Jack needs to know is the order of the cards and what is on their face, nothing more.
John speaks the truth only once a day in a week. Below are a few hints for you:
First: Days are Sunday, Monday and so on.
Second: One day he says, "I lie on Monday and Tuesday".
Third: On the next day, he says, "Today is either Thursday, Saturday or Sunday".
Fourth: On the next day, he says, "I lie on Wednesday and Friday".
Can you identify the day on which he speaks the truth?
You along with your friend are standing in front of two houses. Each of those houses inhabits a family with two children.
Your friend tells you the below two facts:
1) On your left is a family that has a boy who likes accounts but the other child loves science.
2) On the right is a family with a seven-year-old boy and a newborn baby.
You ask him, "Does either of the family have a girl?"
To this, he replies, "I am not quite sure. But can you guess that? If you are right, I will give you $500."
Which family do you think is likely to have a girl?
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
