Solution:

3rd

Explanation:
In the 3rd image, all the three arrows curved in the same direction while in other images they curved in different directions.

Solution:

10 prisoners must sample the wine. Bonus points if you worked out a way to ensure than no more than 8 prisoners die.

Number all bottles using binary digits. Assign each prisoner to one of the binary flags. Prisoners must take a sip from each bottle where their binary flag is set.

Here is how you would find one poisoned bottle out of eight total bottles of wine.

Bottle 1 Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle 6 Bottle 7 Bottle 8
Prisoner A X X X X
Prisoner B X X X X
Prisoner C X X X X
In the above example, if all prisoners die, bottle 8 is bad. If none die, bottle 1 is bad. If A & B dies, bottle 4 is bad.

With ten people there are 1024 unique combination so you could test up to 1024 bottles of wine.

Each of the ten prisoners will take a small sip from about 500 bottles. Each sip should take no longer than 30 seconds and should be a very small amount. Small sips not only leave more wine for guests. Small sips also avoid death by alcohol poisoning. As long as each prisoner is administered about a milliliter from each bottle, they will only consume the equivalent of about one bottle of wine each.

Each prisoner will have at least a fifty percent chance of living. There is only one binary combination where all prisoners must sip from the wine. If there are ten prisoners then there are ten more combination where all but one prisoner must sip from the wine. By avoiding these two types of combination you can ensure no more than 8 prisoners die.

One viewer felt that this solution was in flagrant contempt of restaurant etiquette. The emperor paid for this wine, so there should be no need to prove to the guests that wine is the same as the label. I am not even sure if ancient wine even came with labels affixed. However, it is true that after leaving the wine open for a day, that this medieval wine will taste more like vinegar than it ever did. C'est la vie.

Solution:

The stranger said that he thought the room was his. If so, he must have had the keys to the room and thus he must not have knocked.

Solution:

I spoke with Joe.

Explanation:
There can be only two cases. Either Zoe is a liar or Joe is a liar.

First Case
Let us assume that Zoe is a liar and Joe is a truthful person.
If I asked the question from Joe, the answer will be yes. If I asked the question from Zoe, the answer will be no. Thus in this case, I must have asked from Joe.

Second Case
Let us assume that Zoe is a truthful and Joe is a liar.
If I asked the question from Joe, the answer will be yes. If I asked the question from Zoe, the answer will be no. Thus in this case as well, I must have asked from Joe only.

Solution:

13 numbers

Explanation:
Since we are looking to find odd reminder which implies that the remainder will be either 1 or 3
Therefore number must follow below two conditions:
A) We can list number 5n + 1 or 5n + 3. (where n = 0,1,2,3.....)
B) The number must end in 1 or 3.

List of such numbers less than 100 are:
1, 3, 11, 13, 21, 23, 31, 33, 41, 43, 51, 53, 61, 63, 71, 73, 81, 83, 91, 93

Let's remove the nonprime ones which are 1, 21, 33, 51, 63, 81 and 91

So, I will be left with 13 numbers which fit the bill.
3, 11, 13, 23, 31, 41, 43, 53, 61, 71, 73, 83 and 93

Solution:

mother

We know from (3) that the youngest person was not the victim, from (4) that the youngest person was not the helper and from (6) that the youngest person was not the killer. The youngest person can only have been the witness therefore. If we make up a chart there are now three possible combinations:

Oldest person (father) H H M

Next to oldest (mother) V M H

Next to youngest (son) M V V

Youngest (daughter) W W W

(H = Helper ; V = Victim ; M = Murderer ; W = Witness)

We can work out from (5) that the father was the oldest, from (2) that the youngest person must have been the daughter. Therefore the next to the youngest must have been the son and the next to the oldest, the mother.

Solution:

It can be down as shown below.

Solution:

Move the coins as given in the figure and you will get the required result.

Solution:

It will take the man 58 minutes to reach the top.

Since he is climbing 3 feet and falling 2 feet back every passing minute, he is actually climbing 1 feet every minute.
Therefore, he would have climbed 57 feet in 57 minutes. The remaining distance is 3 feet. He will take one more minute to climb it and reach the surface. Since he has reached the top surface, he won't slip back.

Solution:

I am Spice

Explanation:
Spice is hot if you remove first two alphabets then it will become "ice", which is really cold.

Solution:

Michelangelo juggles the diamonds across while crossing the bridge.