Solution:

89

Solution:

The figure tells that B is located to the North-East of E.

Solution:

There is a simple logic to solve this question.
The size of the chocolate is 2 x 8. Thus, you need to have 2 x 8 = 16 pieces.
Every time you break the chocolate, you will get one extra piece.
Thus, to get 16 pieces, you must break it (16 - 1) = 15 times.

Solution:

It can be solved as below.

Solution:

The attached picture shows you how you can do it. If you were able to deduce any other way, feel free to comment.

Solution:

9 - 8 + 76 - 5 + 4 + 3 + 21 = 100


Other ways of making number 100 (withiout using number 32)
98 + 7 + 6 - 5 - 4 - 3 + 2 - 1 = 100
98 - 7 - 6 - 5 - 4 + 3 + 21 = 100
9 - 8 + 76 - 5 + 4 + 3 + 21 = 100
98 - 7 + 6 + 5 + 4 - 3 - 2 - 1 = 100
98 + 7 - 6 + 5 - 4 + 3 - 2 - 1 = 100
98 + 7 - 6 + 5 - 4 - 3 + 2 + 1 = 100
98 - 7 + 6 + 5 - 4 + 3 - 2 + 1 = 100
98 - 7 + 6 - 5 + 4 + 3 + 2 - 1 = 100
98 + 7 - 6 - 5 + 4 + 3 - 2 + 1 = 100
98 - 7 - 6 + 5 + 4 + 3 + 2 + 1 = 100
9 + 8 + 76 + 5 + 4 - 3 + 2 - 1 = 100
9 + 8 + 76 + 5 - 4 + 3 + 2 + 1 = 100

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:

There are two things to keep in mind:
Firstly there is at least one red hat. (There can be two or three as well).
Secondly the competition is fair for everyone.

Thus if there is only one red hat, that person will see two green hats on other heads and will be able to deduce his own color as red. However the other students will see one red and one green hat and can never be sure. In such manner, the competition will prove to be partial for one student.

Suppose if there are two red hats. Then the students who are wearing red hats will see one red and one green hat on others. Now they must have deduced that there can’t be just one red hat. Thus they will know that they are also wearing a red hat. But the one who is wearing a green hat will see two red hats and can never be sure of his own color. In this case as well, the competition will not be fair.

Thus the only possible and fair means is if all of them are wearing a red hat. The one who is able to deduce the situation first, will raise his hand and will tell the correct answer.

Solution:

Fred Odea won.

Just look at the announcement lines. The first sentence in 'Ok now everybody!' If you take out just the first letter of every word, it will form 'ONE'. In the same manner the second sentence 'The winner of…..' will give form 'TWO' and the third sentence 'The Hardest Riddle Ever Event.' Will form THREE.

Thus the final sentence must form FOUR. There is only one candidate who can suffice with the first two letter and he is Fred Odea. The final sentence of the mastermind must be, 'Fred Odea: Ultimate Riddler!'

Solution:

This is more of a philosophical question than being a riddle or a puzzle. The action of Brian directly led to the result which is the death of Chris. Thus he murdered Chris. In a sense, Chris died due to the lack of water. It is the circumstances that ultimately led to his death.

Solution:

They are matched as shown in the picture below.