15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.
How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?
In the attached figure, you can see a chessboard and two rooks placed on the chess board. What you have to find is the number of squares that do not contain the rooks. How many are there?
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 ?