Solution:

Let us first calculate the total number of matches that will be placed:
9C2 * 2
= 9! / (2!7!) * 2
= 8 * 9
= 72
Therefore, every team will play 16 matches.

Let us now glance over the cases that are possible.

Case 1:
Let us say that Team A, Team B and Team C wins 14 matches each (they lose 1 match each from the other two teams), then the Team D can win only (16 - 3 * 2) = 10 matches.

Case 2:
Suppose that, the top 4 teams win 13 matches each.
Team A will win 13 matches and will lose 3 matches from Team B, Team C and Team D.
Team B will win 13 matches and will lose 3 matches from Team A, Team C and Team D.
Team C will win 13 matches and will lose 3 matches from Team A, Team B and Team D.
Team D will win 13 matches and will lose 3 matches from Team A, Team B and Team C.

If this case actually happens, then the Team E will be able to win 8 matches at maximum as Team A, Team B, Team C and Team D will win all the matches played by E.

Case 3:
Suppose that, the top 5 teams win 12 matches each.
Team A will win 12 matches and will lose 3 matches from Team B, Team C, Team D and Team E.
Team B will win 12 matches and will lose 3 matches from Team A, Team C, Team D and Team E.
Team C will win 12 matches and will lose 3 matches from Team A, Team B, Team D and Team E.
Team D will win 12 matches and will lose 3 matches from Team A, Team B, Team C and Team E.
Team E will win 12 matches and will lose 3 matches from Team A, Team B, Team C and Team D.

If this case actually happens, Team E will win 12 matches but it still won't be able to get into the playoffs assuming that it has the lowest run rate among all.

This implies that from case 2, it is evident that a team must win 13 matches at the least to confirm its position in the playoffs.

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:

Take 10 number of cards in a new deck and change their face direction. For example- You create a new deck of 10 cards and out of 10, 3 faces up in the new deck. So remaining 7 faces up are in the old deck. But hey! while creating the new deck you reversed the face direction of new cards. So actually the 3 cards which were facing up are actually face down in the new deck while 7 faces up.

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:

You can ask this question to any one person, "if I ask the man who is next you: which is the correct way and the road to the village, what would the person next to you answer?"
If you happened to ask this question to the liar, he will show you the wrong way.
And if you happened to ask this question to the one who says truth, he will also show you the wrong way.
Once you are done with this, take the other way. This will lead you to the village

Solution:

73

Explanation:
It's a very famous puzzle known as "Josephus Problem Puzzle". It can be solved in various ways but the trick to solve this problem is illustrated below.

Binay number of 100 is: 1100100
complement pf 100 is 0011011, whose decimal equivalent is 27.
The desired answer will be 100 - 27 = 73

Solution:

The driver is actually the wife and mother.

Solution:

3 1 2 2 1 1
1 3 1 1 2 2 2 1

Read Line as one 1 => 1
Read Line 2 as two one => 2 1
Read Line 3 as one two and one one => 1 2 1 1
and so on.

Solution:

2, 3, 10 and 10
To maintain the difference of eight and keeping in mind the third and fourth hint, the first and third cards can be 2 and 10 or 10 and 2. But keeping in mind the first hint, we know that the first card is 2 and the third is 10. Similarly, if we see the fifth hint, the difference between the second and fourth card should be 7. Thus we know that the second card is 3 and the fourth card is 10.

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:

1 2 3 4 5 6 and 7 8 6

Since summation of numbers 1-9(1 2 3 4 5 6 7 8 9) is 45 , so its impossible to divide into two equal parts.
Since we cant flip over 6 to make it 9 but we can flip 9 to make it 6 and hence the solution