Solution:

19|9|9

Explanation:
This is simple. All the months have been coded with a distinctive way.
Let's see about January:
January = 1071 = 10|7|1
10 is the position of J, the first letter of January in alphabetical order.
7 is the number of letters used in forming the word January.
1 is the position of January in the calendar.

For February:
February = 682 = 6|8|2
6 is the position of F, the first letter of February in the alphabetical order.
8 are the number of letters used in forming the word.
2 is the position of February in the calendar.

Similarly, September = 19|9|9
19 is the position of S, the first letter of September in the alphabetical order.
9 are the number of letters used in forming the word.
9 is the position of September in the calendar.

Solution:

he was genius.

Officials must have thought he was jumping with a hostage, they would never risk giving him a faulty parachute.

Solution:

4 6 5 3 (from magician perspective)
3 5 6 4 (viewer perspective)

Detail:

From user perspective:
3 5 6 4 => 5 6 4 3 => 6 5 4 3

For magician perspective
3 4 5 6 (ascending order as)

Solution:

13 + 11 + 6 = 30

Explanation
The trick is that you just need to rotate '9' to form '6'.

Solution:

"World War I" was named after after "World War II"

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:

Step one: First you will have to make 3 trips of 1,000 apples 333 miles. Then you will be left with 2,001 apples and 667 miles to go.

Step two: Next you will have to take 2 trips of 1,000 apples 500 miles. In this manner you will be left with 1,000 apples and 167 miles to go (you have to leave an apple behind).

Step three: At last, you will have to travel the last 167 miles with one load of 1,000 apples and you will be left with 833 apples when you reach the town

Solution:

Put one black rock in one sack and put all the rest in the other one. In such manner you will get about 3/4 probability of surviving.

Solution:

99 matches.

The number of matches will always sum up to one less than the number of players in a knock out tournament. You may calculate it in any manner. Thus 99 matches were played.

Solution:

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

Solution:

If you see the picture, they formed a pentagonal shape and achieved the required.