Solution:

The baby

Solution:

Everyone will done one day or other.

Abraham Lincoln era is too old and we expect most of them(if not all) to be dead by now.

Solution:

7 Races.

Solution:

The probability of two numbers being relatively prime is 60%. Thus if you keep playing the bet, you will hypothetically make 20 cents on every play.

Thus, you should accept the bet.

Solution:

The receptionist was pretty clever she played with the mute button of the phone while talking with her mother. She muted everything except the word emergency, call and help. So while talking, she sounded like 'Emergency… Call… Help' to her mother and thus she called the police.

Solution:

The figure tells that B is located to the North-East of E.

Solution:

25 Fruits

Remember we told you that Birbal is a witty trader. So his sole motive is to get rid of the sacks as fast as he can.

For the first sack:
He must be able to fill fruits from one sack to other two sacks. Assume that he is able to do that after M check points. Now to find M,

(Space in first sack) M + (Space in second sack) M = (Remaining fruits in Third Sack) 30 – M
M = 10

Thus after 10 checkpoints, Birbal will be left with only 2 sacks containing 30 fruits each.

Now he must get rid of the second sack.
For that, he must fill the fruits from second sack to the first sack. Assume that he manages to do that after N checkpoints.

(Space in First Sack) N = (Remaining fruits in second sack) 30 – N
N = 15

Thus after he has crossed 25 checkpoints, he will be left be one sack with 30 fruits in it. He has to pass five more checkpoints where he will have to give five fruits and he will be left with twenty five fruits once he has crossed all thirty check points.

Solution:

Both will rotate at Same speed.

Explanation:
Gears of the same size will always rotate at constant speeds despite any smaller or larger gears in between them.

Solution:

The answer is 'R'

It represents the gear stick. The number 1-5 represents gears and the last one thus should be reverse i.e. R.

Solution:

There are two things to keep in mind:
Firstly there is at least one red hat. (There can be two or three as well).
Secondly the competition is fair for everyone.

Thus if there is only one red hat, that person will see two green hats on other heads and will be able to deduce his own color as red. However the other students will see one red and one green hat and can never be sure. In such manner, the competition will prove to be partial for one student.

Suppose if there are two red hats. Then the students who are wearing red hats will see one red and one green hat on others. Now they must have deduced that there can’t be just one red hat. Thus they will know that they are also wearing a red hat. But the one who is wearing a green hat will see two red hats and can never be sure of his own color. In this case as well, the competition will not be fair.

Thus the only possible and fair means is if all of them are wearing a red hat. The one who is able to deduce the situation first, will raise his hand and will tell the correct answer.

Solution:

The Stars