Solution:

He should draw any chit of paper and before unfolding it, he must eat and swallow the chit. In this manner, to determine the judgment of the god, they will have to look at the other chit which will have 'Guilty' written over it. Thus everyone will believe that the chit which he ate had innocent written over it and thus they will believe that he is innocent.

Solution:

First fill the 8 liters jug complete - 4, 8, 0
Fill the 5 liters jug with 8 liters jug - 4, 3, 5
Pour back the beer from 5 liters jug to 12 liters jug - 9, 3, 0
Pour the 3 liters from 8 liters jug to 5 liters jug - 9, 0, 3
Fill the 8 liters jug completely from 12 liters jug - 1, 8, 3
Fill the 5 liters jug from the 8 liters jug - 1, 6, 5
Pour the entire 5 liters jug back in 12 liters jug - 6, 6, 0

You have successfully split the beer into two equal parts.

Solution:

Yes it is possible in Roman Numerals. In Roman Numerals,
9 = IX
10 = X
11 = XI

Thus by removing one from 9, you are getting 10 and by removing one from 11, you are getting 10 again.

Solution:

It can be solved as below.

Solution:

13 numbers

Explanation:
Since we are looking to find odd reminder which implies that the remainder will be either 1 or 3
Therefore number must follow below two conditions:
A) We can list number 5n + 1 or 5n + 3. (where n = 0,1,2,3.....)
B) The number must end in 1 or 3.

List of such numbers less than 100 are:
1, 3, 11, 13, 21, 23, 31, 33, 41, 43, 51, 53, 61, 63, 71, 73, 81, 83, 91, 93

Let's remove the nonprime ones which are 1, 21, 33, 51, 63, 81 and 91

So, I will be left with 13 numbers which fit the bill.
3, 11, 13, 23, 31, 41, 43, 53, 61, 71, 73, 83 and 93

Solution:

It can be solve as shown below.

Solution:

100

Series of number that do not contain albhabet 'T'

Solution:

Never

Explanation:
In the question, the distance of x miles is given at a particular moment. The middle car is running at that time at 50 MPH. The distance will keep increasing with time as three are running at different speeds. It will increase by x miles every hour till a certain point of time and then it will start decreasing till the fastest car meets the slowest again.

As per question, all the cars stop then. Thus, the distance will never be x miles again.

Solution:

19

Explanation:
The children can purchase 19 chocolates in return.

Out of 77 wrappers, 75 will be used to buy 15 chocolates and two will be left spare.
The 15 chocolates will create 15 empty wrappers that can be exchanged to get three chocolates.
Three chocolates will return three wrappers which will help them buy another chocolate.
Now the wrapper from this chocolate and the two spare that were left earlier will get them another chocolate.
15 + 3 + 1 = 19

Solution:

2 minutes (duration between 9:59 and 10:01)

Solution:

17 min

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 minutes. 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 minutes