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:

Since Jasmine and Thibault ate equal amount, they should pay the same amount. But since that's not possible, they can decide with 'rock, paper, scissor' or an equivalent measure to determine who will pay the extra dollar. Now, let's assume tha Jasmine pays $1 extra after losing

Jasmine will pay $5, Thibault will pay $4 and Noah will pay $2.

If the pizza's cost was $11, we can simply keep the same offset and divide. Jasmine is paying 6% more, Thibault is paying 15% more and Noah is paying 27% more.
Keeping the offset same both Jasmine and Thibault will pay $5 each and Noah will pay $1.

Solution:

31

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

Solution:

10

Explanation:
Equation 1 + 9 + 11 = 1 can be derived from
One (o) + nine (n) + eleven (e) = one => 1

Similarly for equation,
12 + 11 + 9
Twelve (t) + eleven (e) + nine (n) => ten (10)

Solution:

prinka is 10, in a system that awards five for each vowel.

Solution:

Lucky days are here again.

Explanation:
Lucky + Day + s + R + H + Ear + Again (Flower represent lucky symbol)

Solution:

It will take the man 58 minutes to reach the top.

Since he is climbing 3 feet and falling 2 feet back every passing minute, he is actually climbing 1 feet every minute.
Therefore, he would have climbed 57 feet in 57 minutes. The remaining distance is 3 feet. He will take one more minute to climb it and reach the surface. Since he has reached the top surface, he won't slip back.

Solution:

XIX is the answer which refers to nineteen in roman numeric system. On taking out one i.e. I, we will get XX that is equal to twenty.

Solution:

Sam : 2
Dean : 5
Castiel : 7

Age diff
7 - 2 = '5' is prime
7 - 5 = '2' is prime
5 - 2 = '3' is prime

Solution:

1/3

Explanation
Assuming T1 is the Toy for brother1, T2 is the toy for brother2 and T3 is the toy for brother3.

Following are the possible cases for toys distribution:

Boy1 Boy2 Boy3
T1 T2 T3
T1 T3 T2
T2 T1 T3
T2 T3 T1 .... (A)
T3 T1 T2 .... (B)
T3 T2 T1

In both steps (A) & (B), no one gets the correct toy.
Therefore probability that none brother can get the own toy is 2/6 = 1/3

Solution:

It can surely be true because it is not mentioned that it was raining.