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:

Sam : 2
Dean : 5
Castiel : 7

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

Solution:

Think deeply about the door number 56, people will visit it for every divisor it has. So 56 has 1 & 56, 2 & 28, 4 & 14, 7 & 8. So on pass 1, the 1st person will open the door; pass 2, 2nd one will close it; pass 4, open; pass 7, close; pass 8, open; pass 14, close; pass 28, open; pass 56, close.
Thus we can say that the door will just end up back in its original state for each pair of divisor. But what about the cases in which the pair of divisor has analogous number for example door number 16? 16 has the divisors 1 & 16, 2 & 8, 4&4. But 4 is recurrent because 16 is a perfect square, so you will only visit door number 16, on pass 1, 2, 4, 8 and 16… leaving it open at the end. So only perfect square doors will remain open at the end.

Solution:

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

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:

3/7

Explanation:
If a 31day month starts on a Friday, Saturday or Sunday it will have five Sunday, if not it will have 4 Sunday.

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:

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

Solution:

It has been clearly mentioned that all the boxes are labeled incorrectly. If he opens the Box3, then he will get either Dark Chocolates or Milk Chocolates as it is labeled incorrectly. Let us suppose he finds Dark Chocolates in there. Now since all are labeled incorrectly, Box B A must contain Milk Chocolates and Box B must contain Milk Chocolates and Dark Chocolates.

Solution:

Steps:
1) Light fire on first bar from both the ends and second bar from one end.

2) After 30 seconds(when first bar gets completely burned out) , burn the second bar from second end as well.

3) When second run completely gets burned , you know its 45 seconds.

Solution:

Costa

Explanation:
c + 1 characters-> d
o + 2 characters-> q
s + 3 characters-> v
t + 4 characters-> x
a + 5 characters-> f

=> dqvxf = costa