Solution:

Jamie is a window cleaner who was tired after cleaning the windows on the 45th floor and thus leaped inside the building.

Solution:

10,15,9,20,12

Explanation:
The score obtained on the first throw is 10.
The score obtained on the second throw is 15.
The score obtained on the third throw is 9.
The score obtained on the fourth throw is 20.
The score obtained on the fifth throw is 12.

Solution:

2 people

Say 2 helpers are Helper1 & Helper2

Helper1 food Helper2 food McDuck's Food
End of Day 1 : 1 4 4
Now 'A' will head back

End of Day 2 : N/A 2 4
Now 'B' will head back

Now Mr. McDuck have 4 day food :-)

Solution:

31

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

Solution:

The teacher will use a simple trick to form a perfect impression. He will ask all his students to raise their hands on each of the question that is asked. But the only catch will be that those who knows the answer correctly will raise their right hand and others will raise their left hand.

In this way, the principal will see all the hands being raised for each question even though all won't be knowing the correct answer. The teacher will ask only those who know the answer and they will always be correct. So the principal will be impressed to full extent.

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:

They used the planks in the manner that is shown in the figure.

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:

40 balls

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:

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.