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?
There is a straight highway. Four different villages lie on that highway. The distance between them is different. The third village is 60km away from the first village; the fourth is 40 km away from the second; the third is 10 km near to the fourth that it is to the second.
Can you calculate the distance between the fourth and the first village ?