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?
Only one color, but not one size,
Stuck at the bottom, yet easily flies.
Present in sun, but not in rain,
Doing no harm, and feeling no pain.
What is it?
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?
Two trains start at the same time, one from Bangalore to Mysore and the other from Mysore to Bangalore. if they arrive at their destinations one hour and four hours respectively after passing one another, how much faster is one train running than the other?
