Solution:

7 AM

Explanation:
Train A covers 20x3 km i.e. 60 kms in 3hrs and
Train B covers 25x2 km i.e. 50 kms in 2hrs => total of 110kms

Solution:

What must be kept in mind before you start calculating through any method is that the weights can be put on both the pans.

So the weights - 1, 3, 7, 12, 43, 76, 102

The oldest man that can be weighed using these weights is a man aged 122 years

Solution:

Now there can be two solutions to the given situation because there can be two situations:
Suppose if B and C have same colors, A will know that his color is the other one and he will be able to speak up the first.
Now if B and C do not have same colors, A will stay silent. This will tell B that his and C's colors are different. Thus he will speak up first.

So either A or B will speak up first depending on the situation.

Solution:

One of the cop will move clockwise while the other will move anti-clockwise every day. In such a manner, they will catch the thief in minimum seven days.

Solution:

It has been clearly mentioned that all the boxes are labeled incorrectly. If he opens the Box3, then he will get either Dark Chocolates or Milk Chocolates as it is labeled incorrectly. Let us suppose he finds Dark Chocolates in there. Now since all are labeled incorrectly, Box B A must contain Milk Chocolates and Box B must contain Milk Chocolates and Dark Chocolates.

Solution:

So that the following plan can be followed, let us number the coins from 1 to 12. For the first weighing let us put on the left pan coins 1,2,3,4 and on the right pan coins 5,6,7,8.

There are two possibilities. Either they balance, or they don't. If they balance, then the different coin is in the group 9,10,11,12. So for our second one possibility is to weigh 9,10,11 against 1,2,3

(1) They balance, in which case you know 12 is the different coin, and you just weigh it against any other to determine whether it is heavy or light.
(2) 9,10,11 is heavy. In this case, you know that the different coin is 9, 10, or 11, and that that coin is heavy. Simply weigh 9 against 10; if they balance, 11 is the heavy coin. If not, the heavier one is the heavy coin.
(3) 9,10,11 is light. Proceed as in the step above, but the coin you're looking for is the light one.

That was the easy part.

What if the first weighing 1,2,3,4 vs 5,6,7,8 does not balance? Then any one of these coins could be the different coin. Now, in order to proceed, we must keep track of which side is heavy for each of the following weighings.

Suppose that 5,6,7,8 is the heavy side. We now weigh 1,5,6 against 2,7,8. If they balance, then the different coin is either 3 or 4. Weigh 4 against 9, a known good coin. If they balance then the different coin is 3, otherwise it is 4. The direction of the tilts can tell us whwther the offending coin is heavier or lighter.

Now, if 1,5,6 vs 2,7,8 does not balance, and 2,7,8 is the heavy side, then either 7 or 8 is a different, heavy coin, or 1 is a different, light coin.

For the third weighing, weigh 7 against 8. Whichever side is heavy is the different coin. If they balance, then 1 is the different coin. Should the weighing of 1,5, 6 vs 2,7,8 show 1,5,6 to be the heavy side, then either 5 or 6 is a different heavy coin or 2 is a light different coin. Weigh 5 against 6. The heavier one is the different coin. If they balance, then 2 is a different light coin.

Solution:

There can be two possibilities for the given situation.

One is if I run on the perimeter. Then, the lion will eventually catch me as the lion can follow my radius and then his trajectory will be half of the circle and not a spiral. Therefore, the lion will subsequently catch me in a finite amount of time.

Secondly if I don’t run on the perimeter, then clearly, I have an infinite amount of time before the lion catches me.

Solution:

First fill the 8 liters jug complete - 4, 8, 0
Fill the 5 liters jug with 8 liters jug - 4, 3, 5
Pour back the beer from 5 liters jug to 12 liters jug - 9, 3, 0
Pour the 3 liters from 8 liters jug to 5 liters jug - 9, 0, 3
Fill the 8 liters jug completely from 12 liters jug - 1, 8, 3
Fill the 5 liters jug from the 8 liters jug - 1, 6, 5
Pour the entire 5 liters jug back in 12 liters jug - 6, 6, 0

You have successfully split the beer into two equal parts.

Solution:

5 leopard and one sheep

since all animal are rational , once 1st leopard eats the sheep all the rest of leopard would know about this.

Solution:

At each draw, the number of strawberry candies are either decreasing by 2 or not decreasing at all. In the case of orange candies, at each draw, they are either increasing by 1 or decreasing by 1.

Thus on an assumed outset with at least one candy in the jar to begin with, if the number of strawberry candies are 0 or are even in numbers, they will finish off leaving an orange candy at the end. If otherwise, the remaining candy will be a strawberry one.

Solution:

Think deeply about the door number 56, people will visit it for every divisor it has. So 56 has 1 & 56, 2 & 28, 4 & 14, 7 & 8. So on pass 1, the 1st person will open the door; pass 2, 2nd one will close it; pass 4, open; pass 7, close; pass 8, open; pass 14, close; pass 28, open; pass 56, close.
Thus we can say that the door will just end up back in its original state for each pair of divisor. But what about the cases in which the pair of divisor has analogous number for example door number 16? 16 has the divisors 1 & 16, 2 & 8, 4&4. But 4 is recurrent because 16 is a perfect square, so you will only visit door number 16, on pass 1, 2, 4, 8 and 16… leaving it open at the end. So only perfect square doors will remain open at the end.