Solution:

5:19

Starting with the watch on the left, add 42 minutes to the time shown to give the time on the next watch to the right

Solution:

Fred Odea won.

Just look at the announcement lines. The first sentence in 'Ok now everybody!' If you take out just the first letter of every word, it will form 'ONE'. In the same manner the second sentence 'The winner of…..' will give form 'TWO' and the third sentence 'The Hardest Riddle Ever Event.' Will form THREE.

Thus the final sentence must form FOUR. There is only one candidate who can suffice with the first two letter and he is Fred Odea. The final sentence of the mastermind must be, 'Fred Odea: Ultimate Riddler!'

Solution:

Jeff Killed Mike

1. Jack is not the murderer, because he is the brother of the murderer.
2. Dan can't be the murderer since he ran a marathon, and the murderer recently had his leg amputated, and wouldn't be running a marathon of any magnitude that quickly.
3. Ben is not the murderer if he just met Jack, since Jack and the murderer grew up together.
4. This leaves Jeff and Mike.

Since Jeff is still alive (he wants to install a new computer next week, present tense) he must be the murderer. Mike also didn't grow up with Jack. It has been determined that Jack, Dan and Jeff are all alive. Ben must also be alive since Jeff plans to install Ben's computer next week. This means that Jeff killed Mike.

Solution:

The ball will take infinite bounces before it is stopped. As per the question it will keep on bouncing half way up every time it hits the ground. But gravity will play its part at certain point of time which will make it stop.

Solution:

There is a simple logic to solve this question.
The size of the chocolate is 2 x 8. Thus, you need to have 2 x 8 = 16 pieces.
Every time you break the chocolate, you will get one extra piece.
Thus, to get 16 pieces, you must break it (16 - 1) = 15 times.

Solution:

73

Explanation:
It's a very famous puzzle known as "Josephus Problem Puzzle". It can be solved in various ways but the trick to solve this problem is illustrated below.

Binay number of 100 is: 1100100
complement pf 100 is 0011011, whose decimal equivalent is 27.
The desired answer will be 100 - 27 = 73

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 driver is actually the wife and mother.

Solution:

What must be kept in mind before you start calculating through any method is that the weights can be put on both the pans.

So the weights - 1, 3, 7, 12, 43, 76, 102

The oldest man that can be weighed using these weights is a man aged 122 years

Solution:

Solution is shown in image below

Solution:

Solution is below