Solution:

Fooling Around

Solution:

mother

We know from (3) that the youngest person was not the victim, from (4) that the youngest person was not the helper and from (6) that the youngest person was not the killer. The youngest person can only have been the witness therefore. If we make up a chart there are now three possible combinations:

Oldest person (father) H H M

Next to oldest (mother) V M H

Next to youngest (son) M V V

Youngest (daughter) W W W

(H = Helper ; V = Victim ; M = Murderer ; W = Witness)

We can work out from (5) that the father was the oldest, from (2) that the youngest person must have been the daughter. Therefore the next to the youngest must have been the son and the next to the oldest, the mother.

Solution:

If you ask the guard who always tells the truth, he would tell you the other guard would point you to the door of death. If you ask the guard who always lies, he would tell you the opposite door of the truth-telling guard and point you to the door of death. In either case, both guards will point to the door of death so you should choose the other one.

Solution:

The best thing for you will be to shoot your first shot in air.

If you try to shoot at Jack and hits him by chance, Leo always hits on the target and you are dead.

If you choose to shoot at Leo and hits him by chance, then there is a fifty percent chance that Jack will hit you.

If you shoot in air, the next turn is of Jack and he knows that Leo is a better shooter which means that he will shoot at him. If he misses, he is definitely dead as Leo will shoot on him coz he shot at him. The next turn will be yours and you stand a 1/3rd chance of hitting him. Also if, he is able to hit Leo. The next chance is yours again and you can try the 1/3rd probability of hitting over Jack.

This is the best situation that you can face. At every other possible way, you will face a worse situation for sure.

Solution:

The first step that they will take will be a leap of logic. What it means is that they will deduce that every color must appear twice at least. Why? Because the master logician has assured them that the puzzle will not be impossible for anyone of them. And if a color appears only once in the circle, the person wearing it will have no clue about that color which will not be fair for him.

Then the logicians will follow the same and look for all the colors of hats in the circle. If one of them sees a color just once, he can safely assume that he is also wearing the hat of the same color as by leap of logic, no color can appear just once. Thus when the bell is rung, he will leave.

In the similar fashion, if anyone sees another color just once, he can determine that he is wearing the hat of the same color and will leave when the bell rings or will be disqualified and sent home. Unvaryingly, if a color is seen twice, they will be eliminated after the first bell. Hence, there must be at least three hats of any of the remaining color.

Assume that you are sitting in the circle and you don’t see a color once but see it twice. Then if they were the only two hats of the same color, the logicians must have left at the first bell already. But they did not. Which means that there are three hats of that color and you are wearing one. Thus you will leave after the second bell.

Solution:

A Question

Solution:

1/36

Explanation:
The number of possibilities for the first as well as the second dice are 6 and 6 respectively. Therefore the total possibilities or outcome are 6 * 6 = 36.
Out of 36 outcomes, we need only one case i.e. the first gives 2 and the second gives 5.
Therefore, the probability will be 1 on 36 or 1/36.

Solution:

Since every bacterium divides into two in two minutes and we know the fact that the dish was half filled with bacteria at 3 pm, after exactly 2 minutes, all will divide into two and will fill the petri dish. Thus, the petri dish will become full at 3:02 pm.

Solution:

20
Just count the nines in the numbers: 6, 16, 26, 36, 46, 56, 76, 86, 96, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69.
Note: 66 contains TWO nines

Solution:

31

Explanation:
Ramanujan lighting the candles in binary.
11110 =30
11111 =31

Solution:

7 Races.