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:

If the man killed himself, he would not have been able to rewind the cassette. Thus it is clear someone else killed him.

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:

60 minutes

Explanation:
Roy will be able to consume all the five tablets in an hour.

Tablet 1 will be taken in 0 min.
Tablet 2 will be taken in 15 min.
Tablet 3 will be taken in 30 min.
Tablet 4 will be taken in 45 min.
Tablet 5 will be taken in 60 min.

Solution:

23rd day

1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 + 11 + 12 + 13 + 14 + 15 + 16 + 17 + 18 + 19 + 20 + 21 + 22 + 23 = 276

Thus our anniversary falls on the 23rd day of the month.

You can apply other formulas to shorten the process but that is the simplest way to do it.

Solution:

A Spider

Solution:

Now there can be two solutions to the given situation because there can be two situations:
Suppose if B and C have same colors, A will know that his color is the other one and he will be able to speak up the first.
Now if B and C do not have same colors, A will stay silent. This will tell B that his and C's colors are different. Thus he will speak up first.

So either A or B will speak up first depending on the situation.

Solution:

If you ask the guard who always tells the truth, he would tell you the other guard would point you to the door of death. If you ask the guard who always lies, he would tell you the opposite door of the truth-telling guard and point you to the door of death. In either case, both guards will point to the door of death so you should choose the other one.

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:

Are you Thorgan

Explanation:
Below will be the reply of three brothers:
Eden: No (speaks truth)
Thorgan: No (speaks lie)
Kylian: Yes (speaks lie)

Therefore if its Kylian then only you will get a reply as "Yes" and then you ask for your money.

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.