Solution:

Number 3

Explanation:
Since it's a ladies bathroom, so only ladies can enter the bathroom and hence most likely the killer.

Solution:

Pages 19, 20, 23, 37, 38, & 42 will also be missing

Solution:

99 matches.

The number of matches will always sum up to one less than the number of players in a knock out tournament. You may calculate it in any manner. Thus 99 matches were played.

Solution:

It is best if the person sits on the back of the train. After the stop, the train will be accelerating as it goes into the tunnel. Thus the train will be much master when the back of the train enters the tunnel. In this way, he will have to spend much less time in the tunnel.

Solution:

192

Explanation:
I started with the number 192.
Adding the reversed 291 to 192 gave me 483.
Similarly,
483 + 384 = 867
867 + 768 = 1635
1635 + 5361 = 6996

Solution:

Just 2

Day One: You make your first cut at the 1/7th mark and give that to the worker.
Day Two: You cut 2/7ths and pay that to the worker and receive the original 1/7th in change.
Day three: You give the worker the 1/7th you received as change on the previous day.
Day four: You give the worker 4/7ths and he returns his 1/7th cut and his 2/7th cut as change.
Day Five: You give the worker back the 1/7th cut of gold.
Day Six: You give the worker the 2/7th cut and receive the 1/7th cut back in change.
Day Seven: You pay the worker his final 1/7th.

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:

Four

three placed flat on the table in a triangle(touching each other) and put the fourth one on top of them in the middle.

Solution:

You must put labels on the tablets as A and B before using. In that case, if you pour tablets together, you will get 3A, 2A 1B, 1A 2B or 3B. If they are from the same bottles you can take one from another bottle and save the remaining two for another day. If you get two from same and one from other, you can draw one from another bottle and you will have two pairs of which you can eat one and save the other.

Solution:

199 - 99

Solution:

It has been clearly stated that none of the two students gave same number of correct answers which leads us to two different possibilities of correct answers:
Either (1 + 2 +3 + 4 + 5 = 15) or (0 + 1 + 2 + 3 + 4 = 10) stands true.

After analyzing the question, the maximum number of correct answers possible with the answers Gerry, Billy, Clark, Peeta and Jonathan gave:
Question 1 = 2 (b or c)
Question 2 = 2 (b or c)
Question 3= 4 (True)
Question 4 = 4 (True)
Question 5 = 3 (True)

Let us first assume with the maximum number of correct answers possible according to our data which are 15 (2+2+4+4+3). According to it, Billy must have given all correct answers as he was the only one who answered True for questions 3, 4 and 5. But in that case, Gerry and Clark must have given exactly three correct answers. Furthermore, Peeta and Jonathan must have given two correct answers. Therefore none of them got all the five correct answers which is wrong according to what we have analyzed.

Thus we move on to our next assumption according to which, the total number of correct answers are 10 (0+1+2+3+4). Now we must acknowledge that Questions 3 as well as Question 4 cannot be False as it will mean that the number of correct answers would not be 10. So the students giving wrong answers cannot be Gerry, Billy and Peeta.

Assume that Jonathan got all wrong, it will suggest that Gerry, Clark and Peeta each would have at least two correct answers. Then, Billy would have to be the person with only one correct answer and in that situation, the correct answers for questions 1 and 2 would be a and a respectively. Since that is not possible as then the total number of correct answers would be 1 (a) + 1 (a) + 1 (False) + 4 (True) + 2 (Flase) = 9.

Thus it must be Clark who has given all wrong answers. The correct answers are then b, a, True, False and False. Also, the scores are Clark (0), Billy (1), Gerry (2), Jonathan (3) and Peeta (4).