Solution:

For this answer is 3^0, 3^1, 3^2... That is 1,3,9,27,81,243 and 729.

Solution:

8 liters jar: 8; 5 liters jar: 0; 3 liters jar: 0
Fill 5 liters jar entirely.
8 liters jar: 3; 5 liters jar: 5; 3 liters jar: 0
Fill 3 liters jar with 5 liters jar.
8 liters jar: 3; 5 liters jar: 2; 3 liters jar: 3
Pour entirely from 3 liters jar to 8 liters jar.
8 liters jar: 6; 5 liters jar: 2; 3 liters jar: 0
Pour entirely from 5 liters jar to 3 liters jar.
8 liters jar: 6; 5 liters jar: 0; 3 liters jar: 2
Fill 5 liters jar with water from 8 liters jar.
8 liters jar: 1; 5 liters jar: 5; 3 liters jar: 2
Fill the 3 liters jar with water from the 5 liters jar.
8 liters jar: 1; 5 liters jar: 4; 3 liters jar: 3
Empty 3 liters jar in 8 liters jar.
8 liters jar: 4; 5 liters jar: 4; 3 liters jar: 0

Now you have 4 liters of water in 8 liters jar as well as 5 liters jar.

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:

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:

It is best if the person sits on the back of the train. After the stop, the train will be accelerating as it goes into the tunnel. Thus the train will be much master when the back of the train enters the tunnel. In this way, he will have to spend much less time in the tunnel.

Solution:

1. Fill 5 liters jar ( 5l-jar:5, 3l-jar:0)
2. Transfer to 3 liters pail (5l-jar:2, 3l-jar:3)
3. Empty 3 liters jar ( 5l-jar:2, 3l-jar:0)
4. Transfer 2q from 5 pail to 3 pail (5l-jar:0, 3l-jar:2)
5. Fill 5 liters pail(5l-jar:5, 3l-jar:2)
6. Transfer 1q from 5 pail to 3 pail(5l-jar:4, 3l-jar:3)

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.

Solution:

99 matches.

The number of matches will always sum up to one less than the number of players in a knock out tournament. You may calculate it in any manner. Thus 99 matches were played.

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:

This is more of a philosophical question than being a riddle or a puzzle. The action of Brian directly led to the result which is the death of Chris. Thus he murdered Chris. In a sense, Chris died due to the lack of water. It is the circumstances that ultimately led to his death.