Solution:

301

= Explanation =
Time1 : When there are two pirates, 301/2 => remainder 1
Time2 : When there are three pirates, 301/3 => remainder 1
Time3 : When there are three pirates, 301/4 => remainder 1
Time4 : When there are three pirates, 301/5 => remainder 1
Time5 : When there are three pirates, 301/6 => remainder 1
Time6 : When there are three pirates, 301/7 => remainder 0

Solution:

199 - 99

Solution:

'five'

Its the count of alphabet

Solution:

31

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

Solution:

This problem can be solved with algebra as well as logical reasoning. We are going to tell you how it is logically possible.

Be it any quantity that was present in the beginning and any liquid as well. We know that we have taken a spoonful from one glass and put it into another. Then, we have taken a spoonful from the other glass and put it into the first glass. So, at the end of it, the quantity of liquid in either glass remains same as it was in the beginning.

Therefore, we can conclude the fact that any amount of coke that is missing in the glass with coke will be present in the lemonade glass. Also, the same quantity of lemonade will be missing from the lemonade glass and will be present in the coke glass.

Solution:

I filled a glass full of water and held it over my head for 20 minutes.

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:

17 mins

The initial solution most people will think of is to use the fastest person as an usher to guide everyone across. How long would that take? 10 + 1 + 7 + 1 + 2 = 21 mins. Is that it? No. That would make this question too simple even as a warm up question.

Let’s brainstorm a little further. To reduce the amount of time, we should find a way for 10 and 7 to go together. If they cross together, then we need one of them to come back to get the others. That would not be ideal. How do we get around that? Maybe we can have 1 waiting on the other side to bring the torch back. Ahaa, we are getting closer. The fastest way to get 1 across and be back is to use 2 to usher 1 across. So let’s put all this together.

1 and 2 go cross
2 comes back
7 and 10 go across
1 comes back
1 and 2 go across (done)

Total time = 2 + 2 + 10 + 1 + 2 = 17 mins

Solution:

The three errors are as follows:
a) fynd is spelled wrong. The correct spelling is 'find'.
b) that is not appropriate to use here. It should be 'this'.
c) There are only two errors in the question and that is the third error because the questions asks us to find three.

Solution:

He askes the god to beat him half to death.

Solution:

To do this, he must be pushing the cork inside the bottle and then taking out the coin.