Solution:

It's the Man with the flash light.

Solution:

A SINGLE WORD.

Solution:

I don't like words having the letter "T" in it.

Solution:

As per the puzzle given above The fewest number of aircraft is 3! Imagine 3 aircraft (A, B and C). A is going to fly round the world. All three aircraft start at the same time in the same direction. After 1/6 of the circumference, B passes 1/3 of its fuel to C and returns home, where it is refueled and starts immediately again to follow A and C.

C continues to fly alongside A until they are 1/4 of the distance around the world. At this point C completely fills the tank of A which is now able to fly to a point 3/4 of the way around the world. C has now only 1/3 of its full fuel capacity left, not enough to get back to the home base. But the first 'auxiliary' aircraft reaches it in time in order to refuel it, and both 'auxiliary' aircraft are the able to return safely to the home base.

Now in the same manner as before both B and C fully refueled fly towards A. Again B refuels C and returns home to be refueled. C reaches A at the point where it has flown 3/4 around the world. All 3 aircraft can safely return to the home base, if the refueled process is applied analogously as for the first phase of the flight.

Solution:

1)The first bit is easy, as the first letter of each plate spells WHODUNNIT IX(A challenge to our Detective.)
2)The second bit is a little trickier, but I gave you the solution.If you read the last three letters in each plate from the bottom up and right to left you get ADVANCE EACH LETTER BY THE NUMBER SHOWN, so advance W by 5 to get B, H by 13 to get U and so on until you spell BUTLER DID IT.

Solution:

False- if he had instantly died, how would anybody know his dream

Solution:

A B C
E F G H
I J K L
M N O P
R S T
5 horizontal rows
4 vertical columns
4 diagonals with slope 1 (ROL, NKH, MJG, IFC)
4 diagonals with slope -1 (SNI, TOJE, PKFA, LGB)
2 knight's move diagonals with slope -2 (AJS, BKT)

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:

89

Solution:

It can be done as shown below.