Solution:

They can be expressed as the sum of the cubes of two different sets of numbers.

10^3 + 9^3 = 1729
and
12^3 + 1^3 = 1729

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 man asked the king that he wanted to die of old age.

Solution:

They were playing tennis.

Tiger Phil
30 - 30
40 - 30 (Phil hit a bad shot)
Game won - 30 (Tiger hit an awesome shot)

Solution:

9

Explanation:
2 < 3 < 5
To find out the required number of candies, take one in place of the least number (i.e. take one mango candy) and then add all the greater numbers (i.e. three strawberry and five pineapple candies) to it.

Required number of balls = 1 + 3 + 5 = 9.

Solution:

Both will rotate at Same speed.

Explanation:
Gears of the same size will always rotate at constant speeds despite any smaller or larger gears in between them.

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:

It can be done in 8 moves as shown in the animated image below.

Solution:

31

Explanation:
Ramanujan lighting the candles in binary.
11110 =30
11111 =31

Solution:

At every floor, the detective had to open the window himself. If the man had committed suicide, then at least one of the windows must have been open. A person who is committing suicide won’t close the window behind him. Thus he knows that someone pushed him off the edge and closed the window afterwards.

Solution:

20
Just count the nines in the numbers: 6, 16, 26, 36, 46, 56, 76, 86, 96, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69.
Note: 66 contains TWO nines