There are five people. One of them shot and killed one of the other five.
We know following clues:
1. Dan ran in the NY City Marathon yesterday with one of the innocent men.
2. Mike consider being a farmer before he moved to the city.
3. Jeff is a top notch computer consultant and wants to install Ben new computer next week.
4. The murderer had his leg amputated last month.
5. Ben met Jack for the first time six months ago.
6. Jack has been in seclusion since the crime.
7. Dan used to drink heavily.
8. Ben and Jeff built their last computers together.
9. The murderer is Jack's brother. They grew up together in Seattle.
Consider yourself to be a famous detective "Sherlock Homles", Can you find the killer?
A time long back, there lived a king who ruled the great kingdom of Trojan House. As a part of the renovation of the kingdom to meet future security needs, he asked his chief architect to lay down a new play in a manner that all of his 10 castles are connected through five straight walls and each wall must connect four castles together. He also asked the architect that at least one of his castles should be protected with walls. The architect could not come up with any solution that served all of King's choices, but he suggested the best plan that you can see in the picture below. Can you find a better solution to serve the king's demand?
If an earthquake is 1 point higher on the Richter Scale than another earthquake which is actually 10 times stronger, how much stronger would an earthquake be if it was just half a point higher on the Richter scale?
A and B have a certain number of chocolates with them. If B gives one chocolate to A, they will have an equal number of chocolates. But if A gives one chocolate to B, then A will be left with half the number of chocolates that B has.
Can you find out the number of chocolates they have right now?
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