There is so small cabin inside a deep forest.
All the forest burned out to worst possible but the inside of the cabin is still the same.
However all the person inside the cabin die.
In the picture that is attached with this question, you can find a square which comprises of four little squares inside it. Consider this square to be made with matchsticks. You have to remove two matchsticks such that only two squares remain instead of five.How will you do it ?
In a town, there are four houses located at different distances from each other. Following are the distances:
The third house is 60 meters apart from the first house.
The fourth house is 40 meters apart from the second house.
The third house is 10 meters nearer to the fourth house than it is to the second house.
Can you find out the distance between the fourth and the first house?
You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
Shyla was sleeping in her apartment when suddenly a robber broke into her house. He asked her to stay quiet and started looting the cash and jewelry. Suddenly the landline phone started ringing. The robber pointed a gun at Shyla and asked her to pick up and talk without giving away the situation.
She picked up the phone and it happened to be her husband. She spoke, Is it an emergency darling? Do give me a call when your flight lands, I will prepare your favorite food that will help you relieve the stress. Then she hanged up.
10 minutes after, the police arrive at the scene and catch the robber. How did the police know about the robbery?
What does man love more than life, and hate more than death or mortal strife; that which satisfied men want; the poor have, and the rich require; the miser spends, the spendthrift saves, and all men carry to their graves?
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